YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:35:56,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:35:56,298 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:35:56,309 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:35:56,309 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:35:56,310 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:35:56,311 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:35:56,313 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:35:56,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:35:56,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:35:56,316 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:35:56,316 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:35:56,317 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:35:56,318 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:35:56,319 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:35:56,320 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:35:56,321 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:35:56,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:35:56,324 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:35:56,326 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:35:56,327 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:35:56,328 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:35:56,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:35:56,330 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:35:56,330 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:35:56,331 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:35:56,331 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:35:56,332 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:35:56,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:35:56,333 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:35:56,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:35:56,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:35:56,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:35:56,336 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:35:56,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:35:56,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:35:56,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:35:56,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:35:56,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:35:56,338 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 05:35:56,353 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:35:56,353 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:35:56,354 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:35:56,354 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:35:56,355 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:35:56,355 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:35:56,355 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:35:56,355 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:35:56,355 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:35:56,356 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:35:56,356 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:35:56,356 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:35:56,356 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:35:56,356 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:35:56,356 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:56,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:35:56,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:35:56,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:35:56,357 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:35:56,357 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:35:56,358 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:35:56,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:35:56,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:35:56,358 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:35:56,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:35:56,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:35:56,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:35:56,359 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:35:56,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:35:56,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:35:56,396 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:35:56,400 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:35:56,401 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:35:56,401 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:35:56,402 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:35:56,468 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/ea9ce1088e99441eac8902b4a89b6881/FLAGf8b6c3d8b [2020-06-22 05:35:56,813 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:35:56,814 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 05:35:56,820 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/ea9ce1088e99441eac8902b4a89b6881/FLAGf8b6c3d8b [2020-06-22 05:35:57,218 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/ea9ce1088e99441eac8902b4a89b6881 [2020-06-22 05:35:57,230 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:35:57,231 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:35:57,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:35:57,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:35:57,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:35:57,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf3b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:35:57,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:35:57,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:35:57,413 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:35:57,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:35:57,495 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:35:57,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57 WrapperNode [2020-06-22 05:35:57,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:35:57,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:35:57,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:35:57,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:35:57,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:35:57,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:35:57,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:35:57,530 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:35:57,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:35:57,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:35:57,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:35:57,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:35:57,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:35:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-06-22 05:35:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-06-22 05:35:57,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:35:57,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:35:57,736 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:35:57,736 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:35:57,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:57 BoogieIcfgContainer [2020-06-22 05:35:57,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:35:57,738 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:35:57,738 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:35:57,740 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:35:57,741 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,756 INFO L313 BlockEncoder]: Initial Icfg 14 locations, 17 edges [2020-06-22 05:35:57,758 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:35:57,758 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:35:57,759 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:35:57,759 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:35:57,761 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:35:57,762 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:35:57,762 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:35:57,776 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:35:57,789 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 05:35:57,793 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:35:57,795 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:35:57,803 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 05:35:57,805 INFO L70 RemoveSinkStates]: Removed 4 edges and 3 locations by removing sink states [2020-06-22 05:35:57,807 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:35:57,807 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:35:57,811 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 05:35:57,812 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:35:57,812 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:35:57,812 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:35:57,812 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:35:57,813 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:35:57,813 INFO L313 BlockEncoder]: Encoded RCFG 9 locations, 12 edges [2020-06-22 05:35:57,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:35:57 BasicIcfg [2020-06-22 05:35:57,814 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:35:57,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:35:57,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:35:57,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:35:57,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:35:57" (1/4) ... [2020-06-22 05:35:57,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281713b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (2/4) ... [2020-06-22 05:35:57,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281713b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:57" (3/4) ... [2020-06-22 05:35:57,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281713b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:35:57" (4/4) ... [2020-06-22 05:35:57,822 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:35:57,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:35:57,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:35:57,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:35:57,885 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:35:57,885 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:35:57,886 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:35:57,886 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:35:57,886 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:35:57,886 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:35:57,886 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:35:57,886 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:35:57,886 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:35:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-06-22 05:35:57,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:35:57,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-06-22 05:35:57,971 INFO L451 ceAbstractionStarter]: At program point L15(line 15) the Hoare annotation is: true [2020-06-22 05:35:57,971 INFO L451 ceAbstractionStarter]: At program point L15-1(line 15) the Hoare annotation is: true [2020-06-22 05:35:57,971 INFO L448 ceAbstractionStarter]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-06-22 05:35:57,971 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 15) no Hoare annotation was computed. [2020-06-22 05:35:57,971 INFO L448 ceAbstractionStarter]: For program point gEXIT(lines 10 16) no Hoare annotation was computed. [2020-06-22 05:35:57,972 INFO L448 ceAbstractionStarter]: For program point gFINAL(lines 10 16) no Hoare annotation was computed. [2020-06-22 05:35:57,972 INFO L451 ceAbstractionStarter]: At program point gENTRY(lines 10 16) the Hoare annotation is: true [2020-06-22 05:35:57,972 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:35:57,972 INFO L451 ceAbstractionStarter]: At program point L21(line 21) the Hoare annotation is: true [2020-06-22 05:35:57,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:35:57 BasicIcfg [2020-06-22 05:35:57,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:35:57,977 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:35:57,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:35:57,980 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:35:57,981 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:35:57,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:35:57" (1/5) ... [2020-06-22 05:35:57,982 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74788869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,982 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:35:57,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (2/5) ... [2020-06-22 05:35:57,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74788869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:35:57,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:57" (3/5) ... [2020-06-22 05:35:57,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74788869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:35:57,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:35:57" (4/5) ... [2020-06-22 05:35:57,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74788869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:35:57,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:35:57" (5/5) ... [2020-06-22 05:35:57,987 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:35:58,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:35:58,015 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:35:58,015 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:35:58,015 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:35:58,016 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:35:58,016 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:35:58,016 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:35:58,016 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:35:58,016 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:35:58,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-06-22 05:35:58,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:35:58,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:35:58,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:35:58,047 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:35:58,047 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:35:58,047 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:35:58,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-06-22 05:35:58,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:35:58,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:35:58,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:35:58,050 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-22 05:35:58,050 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:35:58,055 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 3#L21true [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 6#gENTRYtrue [2020-06-22 05:35:58,055 INFO L796 eck$LassoCheckResult]: Loop: 6#gENTRYtrue [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 4#L12true [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 8#L15true [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 6#gENTRYtrue [2020-06-22 05:35:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2514, now seen corresponding path program 1 times [2020-06-22 05:35:58,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:58,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash 65850, now seen corresponding path program 1 times [2020-06-22 05:35:58,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,142 INFO L82 PathProgramCache]: Analyzing trace with hash 74930633, now seen corresponding path program 1 times [2020-06-22 05:35:58,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:58,215 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:35:58,216 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:35:58,216 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:35:58,216 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:35:58,216 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:35:58,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,217 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:35:58,217 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:35:58,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:35:58,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:35:58,217 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:35:58,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,335 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:35:58,335 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:58,343 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:58,353 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:58,353 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:58,383 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:58,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:58,387 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:58,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:58,422 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:58,422 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:58,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:58,457 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:58,457 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:58,485 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:58,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:35:58,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:58,552 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:35:58,554 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:35:58,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:35:58,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:35:58,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:35:58,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:35:58,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:35:58,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:35:58,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:35:58,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:35:58,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:35:58,555 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:35:58,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:58,613 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:35:58,619 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:35:58,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:35:58,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:35:58,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:35:58,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:35:58,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:35:58,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:35:58,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:35:58,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:35:58,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:35:58,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:35:58,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:35:58,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:35:58,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:35:58,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:35:58,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:35:58,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:35:58,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:35:58,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:35:58,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:35:58,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:35:58,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:35:58,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:35:58,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:35:58,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:35:58,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:35:58,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:35:58,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:35:58,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:35:58,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:35:58,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:35:58,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:35:58,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:35:58,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:35:58,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:35:58,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:35:58,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:35:58,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:35:58,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:35:58,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:35:58,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:35:58,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:35:58,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:35:58,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:35:58,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:35:58,651 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:35:58,655 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:35:58,655 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:35:58,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:35:58,657 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:35:58,658 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:35:58,658 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2020-06-22 05:35:58,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:35:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:58,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:35:58,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:35:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:58,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:35:58,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:35:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:58,790 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:35:58,795 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 05:35:58,797 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states. Second operand 4 states. [2020-06-22 05:35:58,896 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states.. Second operand 4 states. Result 49 states and 75 transitions. Complement of second has 24 states. [2020-06-22 05:35:58,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-06-22 05:35:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:35:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2020-06-22 05:35:58,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-22 05:35:58,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:35:58,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-22 05:35:58,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:35:58,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-22 05:35:58,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:35:58,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 75 transitions. [2020-06-22 05:35:58,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 05:35:58,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 60 transitions. [2020-06-22 05:35:58,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 05:35:58,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-06-22 05:35:58,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 60 transitions. [2020-06-22 05:35:58,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:35:58,930 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 60 transitions. [2020-06-22 05:35:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 60 transitions. [2020-06-22 05:35:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2020-06-22 05:35:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 05:35:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2020-06-22 05:35:58,967 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-06-22 05:35:58,967 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 41 transitions. [2020-06-22 05:35:58,967 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:35:58,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 41 transitions. [2020-06-22 05:35:58,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-06-22 05:35:58,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:35:58,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:35:58,969 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:35:58,969 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:35:58,970 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 124#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 130#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 123#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 125#L15 [2020-06-22 05:35:58,970 INFO L796 eck$LassoCheckResult]: Loop: 125#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 132#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 133#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 125#L15 [2020-06-22 05:35:58,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2417117, now seen corresponding path program 1 times [2020-06-22 05:35:58,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:59,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:59,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 05:35:59,020 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:35:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 1 times [2020-06-22 05:35:59,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:59,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:59,067 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:35:59,067 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:35:59,067 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:35:59,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:35:59,067 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:35:59,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:35:59,068 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:35:59,068 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:35:59,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:35:59,068 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:35:59,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:35:59,132 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:59,138 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:35:59,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:59,384 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:59,384 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-2, g_~x=-6} Honda state: {g_#in~x=-2, g_~x=-6} Generalized eigenvectors: [{g_#in~x=1, g_~x=0}, {g_#in~x=-5, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [5, 0, 1] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:59,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:59,418 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:59,418 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:59,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:59,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:59,453 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:59,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:59,487 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:59,487 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 05:35:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:35:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:35:59,516 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-06-22 05:35:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:59,581 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2020-06-22 05:35:59,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:35:59,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 57 transitions. [2020-06-22 05:35:59,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:35:59,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 32 states and 52 transitions. [2020-06-22 05:35:59,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 05:35:59,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 05:35:59,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 52 transitions. [2020-06-22 05:35:59,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:35:59,590 INFO L706 BuchiCegarLoop]: Abstraction has 32 states and 52 transitions. [2020-06-22 05:35:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 52 transitions. [2020-06-22 05:35:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-06-22 05:35:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 05:35:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-06-22 05:35:59,597 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-06-22 05:35:59,598 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-06-22 05:35:59,598 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:35:59,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 51 transitions. [2020-06-22 05:35:59,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-06-22 05:35:59,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:35:59,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:35:59,600 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-06-22 05:35:59,600 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:35:59,600 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 196#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 197#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 205#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 206#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 217#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 224#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 209#L15 [2020-06-22 05:35:59,601 INFO L796 eck$LassoCheckResult]: Loop: 209#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 208#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 210#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 209#L15 [2020-06-22 05:35:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1006104556, now seen corresponding path program 1 times [2020-06-22 05:35:59,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:59,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:59,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:59,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:59,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 05:35:59,634 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:35:59,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 2 times [2020-06-22 05:35:59,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:59,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:59,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:35:59,675 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:35:59,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:35:59,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:35:59,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:35:59,676 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:35:59,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:35:59,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:35:59,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:35:59,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:35:59,677 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:35:59,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:35:59,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:35:59,727 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:35:59,731 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:59,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:35:59,771 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:35:59,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:35:59,973 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-7, g_~x=-2} Honda state: {g_#in~x=-7, g_~x=-2} Generalized eigenvectors: [{g_#in~x=-1, g_~x=0}, {g_#in~x=6, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [6, 0, 1] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,006 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,038 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,038 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,068 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,072 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 05:36:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:36:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:36:00,097 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. cyclomatic complexity: 23 Second operand 5 states. [2020-06-22 05:36:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:00,185 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2020-06-22 05:36:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:36:00,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2020-06-22 05:36:00,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 05:36:00,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 53 transitions. [2020-06-22 05:36:00,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-06-22 05:36:00,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-06-22 05:36:00,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 53 transitions. [2020-06-22 05:36:00,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:36:00,193 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 53 transitions. [2020-06-22 05:36:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 53 transitions. [2020-06-22 05:36:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2020-06-22 05:36:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 05:36:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-06-22 05:36:00,199 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-06-22 05:36:00,199 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-06-22 05:36:00,200 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:36:00,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2020-06-22 05:36:00,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 05:36:00,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:36:00,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:36:00,203 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:36:00,203 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:36:00,203 INFO L794 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 280#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 281#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 279#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 277#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 287#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 275#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 278#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 296#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 293#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 295#gENTRY [2020-06-22 05:36:00,204 INFO L796 eck$LassoCheckResult]: Loop: 295#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 302#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 290#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 295#gENTRY [2020-06-22 05:36:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1715364408, now seen corresponding path program 1 times [2020-06-22 05:36:00,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:36:00,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash 65881, now seen corresponding path program 3 times [2020-06-22 05:36:00,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:00,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,223 INFO L82 PathProgramCache]: Analyzing trace with hash 900227010, now seen corresponding path program 1 times [2020-06-22 05:36:00,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:36:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:36:00,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:36:00,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:36:00,303 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:00,303 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:00,303 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:00,303 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:00,304 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:36:00,304 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,304 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:00,304 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:00,304 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:36:00,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:00,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:00,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,355 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:00,355 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 05:36:00,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,360 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,364 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,364 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,396 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,400 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,449 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,453 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,491 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,491 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,519 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:36:00,550 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,566 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,566 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-1} Honda state: {g_#in~x=-1} Generalized eigenvectors: [{g_#in~x=-1}, {g_#in~x=0}, {g_#in~x=0}] Lambdas: [1, 0, 0] Nus: [0, 0] [2020-06-22 05:36:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 05:36:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:36:00,590 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-06-22 05:36:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:00,700 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2020-06-22 05:36:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 05:36:00,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 83 transitions. [2020-06-22 05:36:00,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 05:36:00,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 83 transitions. [2020-06-22 05:36:00,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2020-06-22 05:36:00,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2020-06-22 05:36:00,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2020-06-22 05:36:00,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:36:00,709 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2020-06-22 05:36:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2020-06-22 05:36:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2020-06-22 05:36:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 05:36:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2020-06-22 05:36:00,717 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2020-06-22 05:36:00,717 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 62 transitions. [2020-06-22 05:36:00,717 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:36:00,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 62 transitions. [2020-06-22 05:36:00,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-22 05:36:00,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:36:00,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:36:00,719 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:36:00,719 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2020-06-22 05:36:00,720 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 379#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 380#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 407#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 382#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 393#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 381#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 384#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 420#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 389#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 387#gENTRY [2020-06-22 05:36:00,720 INFO L796 eck$LassoCheckResult]: Loop: 387#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 392#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 404#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 402#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 418#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 419#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 403#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 390#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 387#gENTRY [2020-06-22 05:36:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1715364408, now seen corresponding path program 2 times [2020-06-22 05:36:00,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:00,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -226969241, now seen corresponding path program 1 times [2020-06-22 05:36:00,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:36:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1206449310, now seen corresponding path program 3 times [2020-06-22 05:36:00,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:00,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-06-22 05:36:00,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:36:00,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:36:00,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2020-06-22 05:36:00,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-06-22 05:36:00,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 05:36:00,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:36:00,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-06-22 05:36:00,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:36:00,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 8 [2020-06-22 05:36:00,917 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:00,918 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:00,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:00,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:00,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:36:00,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:00,918 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:00,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 05:36:00,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:00,919 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:00,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:00,951 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:00,951 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,954 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:00,958 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:00,958 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:00,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:00,984 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:01,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:36:01,013 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:01,018 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:36:01,043 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:01,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:01,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:01,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:01,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:36:01,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:36:01,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:01,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:01,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 05:36:01,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:01,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:01,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:01,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:01,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:01,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:01,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:01,078 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:01,078 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:36:01,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:01,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:01,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:01,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:01,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:01,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:01,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:01,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:01,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:01,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:01,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:01,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:01,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:01,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:01,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:01,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:01,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:01,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:01,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:01,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:01,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:01,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:01,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:01,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:01,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:01,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:01,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:01,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:01,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:01,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:01,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:01,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:01,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:01,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:01,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:01,092 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:36:01,095 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:36:01,095 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:36:01,096 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:36:01,096 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:36:01,096 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:36:01,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [] [2020-06-22 05:36:01,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:36:01,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:01,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 05:36:01,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:01,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:36:01,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:01,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 05:36:01,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:01,352 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:36:01,352 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 9 predicates after loop cannibalization [2020-06-22 05:36:01,353 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 9 loop predicates [2020-06-22 05:36:01,353 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 42 states and 62 transitions. cyclomatic complexity: 22 Second operand 8 states. [2020-06-22 05:36:03,703 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 42 states and 62 transitions. cyclomatic complexity: 22. Second operand 8 states. Result 11761 states and 20894 transitions. Complement of second has 5801 states. [2020-06-22 05:36:03,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 23 states 2 stem states 19 non-accepting loop states 1 accepting loop states [2020-06-22 05:36:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 05:36:03,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 117 transitions. [2020-06-22 05:36:03,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 117 transitions. Stem has 10 letters. Loop has 8 letters. [2020-06-22 05:36:03,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:03,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 117 transitions. Stem has 18 letters. Loop has 8 letters. [2020-06-22 05:36:03,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:03,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 117 transitions. Stem has 10 letters. Loop has 16 letters. [2020-06-22 05:36:03,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:03,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11761 states and 20894 transitions. [2020-06-22 05:36:04,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-06-22 05:36:04,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11761 states to 224 states and 337 transitions. [2020-06-22 05:36:04,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 172 [2020-06-22 05:36:04,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2020-06-22 05:36:04,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 337 transitions. [2020-06-22 05:36:04,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:36:04,114 INFO L706 BuchiCegarLoop]: Abstraction has 224 states and 337 transitions. [2020-06-22 05:36:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 337 transitions. [2020-06-22 05:36:04,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 179. [2020-06-22 05:36:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-06-22 05:36:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 264 transitions. [2020-06-22 05:36:04,138 INFO L729 BuchiCegarLoop]: Abstraction has 179 states and 264 transitions. [2020-06-22 05:36:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:36:04,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:36:04,138 INFO L87 Difference]: Start difference. First operand 179 states and 264 transitions. Second operand 8 states. [2020-06-22 05:36:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:04,301 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-06-22 05:36:04,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 05:36:04,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 104 transitions. [2020-06-22 05:36:04,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 05:36:04,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 70 states and 87 transitions. [2020-06-22 05:36:04,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2020-06-22 05:36:04,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2020-06-22 05:36:04,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 87 transitions. [2020-06-22 05:36:04,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:36:04,310 INFO L706 BuchiCegarLoop]: Abstraction has 70 states and 87 transitions. [2020-06-22 05:36:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 87 transitions. [2020-06-22 05:36:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2020-06-22 05:36:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-06-22 05:36:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2020-06-22 05:36:04,316 INFO L729 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2020-06-22 05:36:04,316 INFO L609 BuchiCegarLoop]: Abstraction has 57 states and 72 transitions. [2020-06-22 05:36:04,316 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 05:36:04,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. [2020-06-22 05:36:04,317 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-06-22 05:36:04,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:36:04,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:36:04,318 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-06-22 05:36:04,318 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:36:04,318 INFO L794 eck$LassoCheckResult]: Stem: 18469#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 18467#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 18468#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18470#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18484#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18485#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18505#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18494#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18485#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18501#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18502#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18498#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18491#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18490#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18492#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18510#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18503#gEXIT >[42] gEXIT-->L15-2: AOR: Formula: (= |v_g_#t~ret1_4| |v_g_#resOutParam_2|) InVars {g_#res=|v_g_#resOutParam_2|} OutVars{g_#t~ret1=|v_g_#t~ret1_4|} AuxVars[] AssignedVars[g_#t~ret1] LVA: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x] 18481#L15-2 [40] L15-2-->gFINAL: Formula: (= |v_g_#res_2| |v_g_#t~ret1_3|) InVars {g_#t~ret1=|v_g_#t~ret1_3|} OutVars{g_#t~ret1=|v_g_#t~ret1_2|, g_#res=|v_g_#res_2|, g_#t~ret0=|v_g_#t~ret0_3|} AuxVars[] AssignedVars[g_#t~ret1, g_#res, g_#t~ret0] 18497#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18493#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18479#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18489#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18512#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18482#L15 [2020-06-22 05:36:04,319 INFO L796 eck$LassoCheckResult]: Loop: 18482#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18483#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18488#L12 [47] L12-->L15: Formula: (> 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18482#L15 [2020-06-22 05:36:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2101012846, now seen corresponding path program 1 times [2020-06-22 05:36:04,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:04,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:04,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:36:04,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-06-22 05:36:04,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:36:04,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:36:04,372 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:36:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash 66511, now seen corresponding path program 4 times [2020-06-22 05:36:04,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:04,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:04,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:04,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:04,411 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:04,411 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:04,411 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:04,411 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:04,411 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:36:04,412 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:04,412 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:04,412 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:04,412 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-22 05:36:04,412 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:04,412 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:04,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:04,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:04,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:04,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:04,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:04,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:04,503 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:04,504 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:04,539 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:36:04,539 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:04,733 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:04,734 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-7, g_~x=-2} Honda state: {g_#in~x=-7, g_~x=-2} Generalized eigenvectors: [{g_#in~x=-1, g_~x=0}, {g_#in~x=6, g_~x=0}, {g_#in~x=-1, g_~x=-1}] Lambdas: [6, 0, 1] Nus: [1, 0] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:04,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:04,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:04,766 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:04,767 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-06-22 05:36:04,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:04,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:04,799 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:04,799 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:04,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:04,827 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:04,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:04,831 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-06-22 05:36:04,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 05:36:04,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-06-22 05:36:04,855 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. cyclomatic complexity: 18 Second operand 7 states. [2020-06-22 05:36:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:04,970 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-06-22 05:36:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 05:36:04,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 67 transitions. [2020-06-22 05:36:04,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:36:04,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 67 transitions. [2020-06-22 05:36:04,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-06-22 05:36:04,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-06-22 05:36:04,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2020-06-22 05:36:04,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:36:04,977 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2020-06-22 05:36:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2020-06-22 05:36:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-06-22 05:36:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-06-22 05:36:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2020-06-22 05:36:04,982 INFO L729 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2020-06-22 05:36:04,982 INFO L609 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2020-06-22 05:36:04,982 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 05:36:04,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 67 transitions. [2020-06-22 05:36:04,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:36:04,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:36:04,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:36:04,984 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-06-22 05:36:04,984 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-22 05:36:04,985 INFO L794 eck$LassoCheckResult]: Stem: 18604#ULTIMATE.startENTRY [49] ULTIMATE.startENTRY-->L21: Formula: (<= 0 v_ULTIMATE.start_main_~x~0_8) InVars {} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_8, ULTIMATE.start_main_#t~ret3=|v_ULTIMATE.start_main_#t~ret3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#res, ULTIMATE.start_main_~x~0, ULTIMATE.start_main_#t~ret3] 18602#L21 [34] L21-->gENTRY: Formula: (= |v_g_#in~xInParam_3| v_ULTIMATE.start_main_~x~0_7) InVars {ULTIMATE.start_main_~x~0=v_ULTIMATE.start_main_~x~0_7} OutVars{g_#in~x=|v_g_#in~xInParam_3|} AuxVars[] AssignedVars[g_#in~x]< 18603#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18639#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18609#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18608#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18612#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18610#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18608#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18611#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18640#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18616#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18606#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18605#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18607#L12 [27] L12-->gFINAL: Formula: (and (= |v_g_#res_1| 1) (= 0 v_g_~x_2)) InVars {g_~x=v_g_~x_2} OutVars{g_#res=|v_g_#res_1|, g_~x=v_g_~x_2} AuxVars[] AssignedVars[g_#res] 18629#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18635#gEXIT >[42] gEXIT-->L15-2: AOR: Formula: (= |v_g_#t~ret1_4| |v_g_#resOutParam_2|) InVars {g_#res=|v_g_#resOutParam_2|} OutVars{g_#t~ret1=|v_g_#t~ret1_4|} AuxVars[] AssignedVars[g_#t~ret1] LVA: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x] 18620#L15-2 [40] L15-2-->gFINAL: Formula: (= |v_g_#res_2| |v_g_#t~ret1_3|) InVars {g_#t~ret1=|v_g_#t~ret1_3|} OutVars{g_#t~ret1=|v_g_#t~ret1_2|, g_#res=|v_g_#res_2|, g_#t~ret0=|v_g_#t~ret0_3|} AuxVars[] AssignedVars[g_#t~ret1, g_#res, g_#t~ret0] 18638#gFINAL [29] gFINAL-->gEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 18637#gEXIT >[43] gEXIT-->L15-1: AOR: Formula: (= |v_g_#t~ret0_4| |v_g_#resOutParam_1|) InVars {g_#res=|v_g_#resOutParam_1|} OutVars{g_#t~ret0=|v_g_#t~ret0_4|} AuxVars[] AssignedVars[g_#t~ret0] LVA: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x] 18600#L15-1 [38] L15-1-->gENTRY: Formula: (= |v_g_#in~xInParam_2| (+ |v_g_#t~ret0_5| (- 1))) InVars {g_#t~ret0=|v_g_#t~ret0_5|} OutVars{g_#in~x=|v_g_#in~xInParam_2|} AuxVars[] AssignedVars[g_#in~x]< 18617#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18599#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18595#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18615#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18636#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18596#L15 [2020-06-22 05:36:04,985 INFO L796 eck$LassoCheckResult]: Loop: 18596#L15 [37] L15-->gENTRY: Formula: (= |v_g_#in~xInParam_1| (+ v_g_~x_5 (- 1))) InVars {g_~x=v_g_~x_5} OutVars{g_#in~x=|v_g_#in~xInParam_1|} AuxVars[] AssignedVars[g_#in~x]< 18615#gENTRY [36] gENTRY-->L12: Formula: (= v_g_~x_1 |v_g_#in~x_1|) InVars {g_#in~x=|v_g_#in~x_1|} OutVars{g_#in~x=|v_g_#in~x_1|, g_~x=v_g_~x_1} AuxVars[] AssignedVars[g_~x] 18636#L12 [46] L12-->L15: Formula: (< 0 v_g_~x_3) InVars {g_~x=v_g_~x_3} OutVars{g_~x=v_g_~x_3} AuxVars[] AssignedVars[] 18596#L15 [2020-06-22 05:36:04,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:04,985 INFO L82 PathProgramCache]: Analyzing trace with hash 715297506, now seen corresponding path program 1 times [2020-06-22 05:36:04,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:04,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:04,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:36:04,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-06-22 05:36:05,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:36:05,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-06-22 05:36:05,033 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 05:36:05,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:05,034 INFO L82 PathProgramCache]: Analyzing trace with hash 66510, now seen corresponding path program 2 times [2020-06-22 05:36:05,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:05,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:05,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:05,087 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:05,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:05,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:05,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:05,088 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:36:05,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:05,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:05,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:05,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 05:36:05,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:05,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:05,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:05,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:05,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:05,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:05,142 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:05,142 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:05,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:05,149 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:05,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:36:05,152 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:05,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:36:05,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:36:05,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:36:05,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:36:13,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:36:13,578 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:13,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:13,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:13,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:13,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:36:13,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:36:13,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:13,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:13,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-22 05:36:13,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:13,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:13,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:13,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:13,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:13,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:13,614 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:13,614 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:36:13,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:13,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:13,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:13,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:13,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:13,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:13,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:13,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:13,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:13,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:13,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:13,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:13,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:13,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:13,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:13,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:13,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:13,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:13,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:13,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:13,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:13,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:13,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:13,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:13,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:13,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:13,627 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:36:13,629 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 05:36:13,629 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:36:13,630 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:36:13,630 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:36:13,630 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:36:13,630 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_~x) = 1*g_~x Supporting invariants [] [2020-06-22 05:36:13,631 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:36:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:13,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjunts are in the unsatisfiable core [2020-06-22 05:36:13,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:13,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:36:13,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:13,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 05:36:13,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:13,864 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 05:36:13,865 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2020-06-22 05:36:13,865 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 54 states and 67 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-06-22 05:36:13,993 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 54 states and 67 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 206 states and 262 transitions. Complement of second has 76 states. [2020-06-22 05:36:13,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-22 05:36:13,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:36:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2020-06-22 05:36:13,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 26 letters. Loop has 3 letters. [2020-06-22 05:36:13,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:13,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 29 letters. Loop has 3 letters. [2020-06-22 05:36:13,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:13,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 26 letters. Loop has 6 letters. [2020-06-22 05:36:13,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:13,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 206 states and 262 transitions. [2020-06-22 05:36:14,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-06-22 05:36:14,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 206 states to 79 states and 104 transitions. [2020-06-22 05:36:14,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-06-22 05:36:14,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2020-06-22 05:36:14,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 104 transitions. [2020-06-22 05:36:14,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:36:14,007 INFO L706 BuchiCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-06-22 05:36:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 104 transitions. [2020-06-22 05:36:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2020-06-22 05:36:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-06-22 05:36:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2020-06-22 05:36:14,012 INFO L729 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2020-06-22 05:36:14,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 05:36:14,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-06-22 05:36:14,013 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand 7 states. [2020-06-22 05:36:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:14,070 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-06-22 05:36:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 05:36:14,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2020-06-22 05:36:14,072 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:36:14,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2020-06-22 05:36:14,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:36:14,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:36:14,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:36:14,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:36:14,073 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:14,073 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:14,073 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:14,073 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 05:36:14,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:36:14,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:36:14,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:36:14,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:36:14 BasicIcfg [2020-06-22 05:36:14,080 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:36:14,081 INFO L168 Benchmark]: Toolchain (without parser) took 16850.79 ms. Allocated memory was 649.6 MB in the beginning and 854.6 MB in the end (delta: 205.0 MB). Free memory was 558.7 MB in the beginning and 431.2 MB in the end (delta: 127.5 MB). Peak memory consumption was 332.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,083 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:36:14,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.02 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 558.7 MB in the beginning and 637.7 MB in the end (delta: -78.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 671.1 MB. Free memory was 636.6 MB in the beginning and 635.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,084 INFO L168 Benchmark]: Boogie Preprocessor took 16.24 ms. Allocated memory is still 671.1 MB. Free memory was 635.5 MB in the beginning and 634.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,085 INFO L168 Benchmark]: RCFGBuilder took 190.77 ms. Allocated memory is still 671.1 MB. Free memory was 634.4 MB in the beginning and 619.0 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,085 INFO L168 Benchmark]: BlockEncodingV2 took 76.05 ms. Allocated memory is still 671.1 MB. Free memory was 619.0 MB in the beginning and 613.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,086 INFO L168 Benchmark]: TraceAbstraction took 161.45 ms. Allocated memory is still 671.1 MB. Free memory was 613.6 MB in the beginning and 603.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,086 INFO L168 Benchmark]: BuchiAutomizer took 16103.86 ms. Allocated memory was 671.1 MB in the beginning and 854.6 MB in the end (delta: 183.5 MB). Free memory was 602.8 MB in the beginning and 431.2 MB in the end (delta: 171.6 MB). Peak memory consumption was 355.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:14,090 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 17 edges - StatisticsResult: Encoded RCFG 9 locations, 12 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 264.02 ms. Allocated memory was 649.6 MB in the beginning and 671.1 MB in the end (delta: 21.5 MB). Free memory was 558.7 MB in the beginning and 637.7 MB in the end (delta: -78.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 33.37 ms. Allocated memory is still 671.1 MB. Free memory was 636.6 MB in the beginning and 635.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 16.24 ms. Allocated memory is still 671.1 MB. Free memory was 635.5 MB in the beginning and 634.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 190.77 ms. Allocated memory is still 671.1 MB. Free memory was 634.4 MB in the beginning and 619.0 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 76.05 ms. Allocated memory is still 671.1 MB. Free memory was 619.0 MB in the beginning and 613.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 161.45 ms. Allocated memory is still 671.1 MB. Free memory was 613.6 MB in the beginning and 603.9 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 16103.86 ms. Allocated memory was 671.1 MB in the beginning and 854.6 MB in the end (delta: 183.5 MB). Free memory was 602.8 MB in the beginning and 431.2 MB in the end (delta: 171.6 MB). Peak memory consumption was 355.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 9 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 4 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (6 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function \old(x) and consists of 6 locations. One nondeterministic module has affine ranking function \old(x) and consists of 23 locations. One nondeterministic module has affine ranking function x and consists of 8 locations. 6 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.0s and 8 iterations. TraceHistogramMax:6. Analysis of lassos took 11.6s. Construction of modules took 0.5s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 104 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 57 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 131 SDtfs, 156 SDslu, 278 SDs, 0 SdLazy, 537 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT1 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf91 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 4 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 9.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:35:53.976 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:36:14.328 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check