107.32/64.48 NO 107.32/64.48 107.32/64.48 Ultimate: Cannot open display: 107.32/64.48 This is Ultimate 0.1.24-8dc7c08-m 107.32/64.48 [2019-03-28 12:24:00,339 INFO L170 SettingsManager]: Resetting all preferences to default values... 107.32/64.48 [2019-03-28 12:24:00,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 107.32/64.48 [2019-03-28 12:24:00,352 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 107.32/64.48 [2019-03-28 12:24:00,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 107.32/64.48 [2019-03-28 12:24:00,355 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 107.32/64.48 [2019-03-28 12:24:00,357 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 107.32/64.48 [2019-03-28 12:24:00,358 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 107.32/64.48 [2019-03-28 12:24:00,359 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 107.32/64.48 [2019-03-28 12:24:00,360 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,360 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 107.32/64.48 [2019-03-28 12:24:00,361 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 107.32/64.48 [2019-03-28 12:24:00,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 107.32/64.48 [2019-03-28 12:24:00,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 107.32/64.48 [2019-03-28 12:24:00,364 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 107.32/64.48 [2019-03-28 12:24:00,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 107.32/64.48 [2019-03-28 12:24:00,366 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 107.32/64.48 [2019-03-28 12:24:00,368 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 107.32/64.48 [2019-03-28 12:24:00,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 107.32/64.48 [2019-03-28 12:24:00,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 107.32/64.48 [2019-03-28 12:24:00,371 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 107.32/64.48 [2019-03-28 12:24:00,374 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,374 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 107.32/64.48 [2019-03-28 12:24:00,375 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 107.32/64.48 [2019-03-28 12:24:00,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 107.32/64.48 [2019-03-28 12:24:00,376 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 107.32/64.48 [2019-03-28 12:24:00,377 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 107.32/64.48 [2019-03-28 12:24:00,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 107.32/64.48 [2019-03-28 12:24:00,378 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 107.32/64.48 [2019-03-28 12:24:00,379 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,380 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 107.32/64.48 [2019-03-28 12:24:00,380 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,380 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 107.32/64.48 [2019-03-28 12:24:00,381 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 107.32/64.48 [2019-03-28 12:24:00,382 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 107.32/64.48 [2019-03-28 12:24:00,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 107.32/64.48 [2019-03-28 12:24:00,382 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 107.32/64.48 [2019-03-28 12:24:00,397 INFO L110 SettingsManager]: Loading preferences was successful 107.32/64.48 [2019-03-28 12:24:00,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 107.32/64.48 [2019-03-28 12:24:00,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 107.32/64.48 [2019-03-28 12:24:00,399 INFO L133 SettingsManager]: * Rewrite not-equals=true 107.32/64.48 [2019-03-28 12:24:00,399 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 107.32/64.48 [2019-03-28 12:24:00,399 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 107.32/64.48 [2019-03-28 12:24:00,399 INFO L133 SettingsManager]: * Use SBE=true 107.32/64.48 [2019-03-28 12:24:00,399 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 107.32/64.48 [2019-03-28 12:24:00,400 INFO L133 SettingsManager]: * Use old map elimination=false 107.32/64.48 [2019-03-28 12:24:00,400 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 107.32/64.48 [2019-03-28 12:24:00,400 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 107.32/64.48 [2019-03-28 12:24:00,400 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 107.32/64.48 [2019-03-28 12:24:00,400 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 107.32/64.48 [2019-03-28 12:24:00,400 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 107.32/64.48 [2019-03-28 12:24:00,401 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:00,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 107.32/64.48 [2019-03-28 12:24:00,401 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 107.32/64.48 [2019-03-28 12:24:00,401 INFO L133 SettingsManager]: * Check division by zero=IGNORE 107.32/64.48 [2019-03-28 12:24:00,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 107.32/64.48 [2019-03-28 12:24:00,402 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 107.32/64.48 [2019-03-28 12:24:00,402 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 107.32/64.48 [2019-03-28 12:24:00,402 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 107.32/64.48 [2019-03-28 12:24:00,402 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 107.32/64.48 [2019-03-28 12:24:00,402 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 107.32/64.48 [2019-03-28 12:24:00,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 107.32/64.48 [2019-03-28 12:24:00,403 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 107.32/64.48 [2019-03-28 12:24:00,403 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 107.32/64.48 [2019-03-28 12:24:00,403 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 107.32/64.48 [2019-03-28 12:24:00,403 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 107.32/64.48 [2019-03-28 12:24:00,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 107.32/64.48 [2019-03-28 12:24:00,442 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 107.32/64.48 [2019-03-28 12:24:00,446 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 107.32/64.48 [2019-03-28 12:24:00,447 INFO L271 PluginConnector]: Initializing CDTParser... 107.32/64.48 [2019-03-28 12:24:00,448 INFO L276 PluginConnector]: CDTParser initialized 107.32/64.48 [2019-03-28 12:24:00,448 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 107.32/64.48 [2019-03-28 12:24:00,510 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/755a252b398d41fe9cdc1705f22fe775/FLAG257f2e1f9 107.32/64.48 [2019-03-28 12:24:00,853 INFO L307 CDTParser]: Found 1 translation units. 107.32/64.48 [2019-03-28 12:24:00,854 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 107.32/64.48 [2019-03-28 12:24:00,862 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/755a252b398d41fe9cdc1705f22fe775/FLAG257f2e1f9 107.32/64.48 [2019-03-28 12:24:01,263 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/755a252b398d41fe9cdc1705f22fe775 107.32/64.48 [2019-03-28 12:24:01,274 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 107.32/64.48 [2019-03-28 12:24:01,276 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 107.32/64.48 [2019-03-28 12:24:01,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 107.32/64.48 [2019-03-28 12:24:01,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 107.32/64.48 [2019-03-28 12:24:01,281 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 107.32/64.48 [2019-03-28 12:24:01,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b017d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:01,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 107.32/64.48 [2019-03-28 12:24:01,313 INFO L176 MainTranslator]: Built tables and reachable declarations 107.32/64.48 [2019-03-28 12:24:01,485 INFO L206 PostProcessor]: Analyzing one entry point: main 107.32/64.48 [2019-03-28 12:24:01,489 INFO L191 MainTranslator]: Completed pre-run 107.32/64.48 [2019-03-28 12:24:01,576 INFO L206 PostProcessor]: Analyzing one entry point: main 107.32/64.48 [2019-03-28 12:24:01,593 INFO L195 MainTranslator]: Completed translation 107.32/64.48 [2019-03-28 12:24:01,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01 WrapperNode 107.32/64.48 [2019-03-28 12:24:01,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 107.32/64.48 [2019-03-28 12:24:01,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 107.32/64.48 [2019-03-28 12:24:01,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 107.32/64.48 [2019-03-28 12:24:01,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 107.32/64.48 [2019-03-28 12:24:01,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 107.32/64.48 [2019-03-28 12:24:01,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 107.32/64.48 [2019-03-28 12:24:01,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 107.32/64.48 [2019-03-28 12:24:01,634 INFO L276 PluginConnector]: Boogie Preprocessor initialized 107.32/64.48 [2019-03-28 12:24:01,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 [2019-03-28 12:24:01,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 107.32/64.48 [2019-03-28 12:24:01,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 107.32/64.48 [2019-03-28 12:24:01,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... 107.32/64.48 [2019-03-28 12:24:01,658 INFO L276 PluginConnector]: RCFGBuilder initialized 107.32/64.48 [2019-03-28 12:24:01,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (1/1) ... 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 107.32/64.48 [2019-03-28 12:24:01,731 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of 107.32/64.48 [2019-03-28 12:24:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of 107.32/64.48 [2019-03-28 12:24:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure mult 107.32/64.48 [2019-03-28 12:24:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure mult 107.32/64.48 [2019-03-28 12:24:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 107.32/64.48 [2019-03-28 12:24:01,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 107.32/64.48 [2019-03-28 12:24:01,732 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ 107.32/64.48 [2019-03-28 12:24:01,733 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ 107.32/64.48 [2019-03-28 12:24:02,001 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 107.32/64.48 [2019-03-28 12:24:02,002 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. 107.32/64.48 [2019-03-28 12:24:02,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:24:02 BoogieIcfgContainer 107.32/64.48 [2019-03-28 12:24:02,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 107.32/64.48 [2019-03-28 12:24:02,004 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 107.32/64.48 [2019-03-28 12:24:02,004 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 107.32/64.48 [2019-03-28 12:24:02,009 INFO L276 PluginConnector]: BlockEncodingV2 initialized 107.32/64.48 [2019-03-28 12:24:02,010 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:24:02" (1/1) ... 107.32/64.48 [2019-03-28 12:24:02,032 INFO L313 BlockEncoder]: Initial Icfg 49 locations, 71 edges 107.32/64.48 [2019-03-28 12:24:02,034 INFO L258 BlockEncoder]: Using Remove infeasible edges 107.32/64.48 [2019-03-28 12:24:02,034 INFO L263 BlockEncoder]: Using Maximize final states 107.32/64.48 [2019-03-28 12:24:02,035 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 107.32/64.48 [2019-03-28 12:24:02,035 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 107.32/64.48 [2019-03-28 12:24:02,037 INFO L296 BlockEncoder]: Using Remove sink states 107.32/64.48 [2019-03-28 12:24:02,038 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 107.32/64.48 [2019-03-28 12:24:02,038 INFO L179 BlockEncoder]: Using Rewrite not-equals 107.32/64.48 [2019-03-28 12:24:02,063 INFO L185 BlockEncoder]: Using Use SBE 107.32/64.48 [2019-03-28 12:24:02,092 INFO L200 BlockEncoder]: SBE split 12 edges 107.32/64.48 [2019-03-28 12:24:02,097 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 107.32/64.48 [2019-03-28 12:24:02,099 INFO L71 MaximizeFinalStates]: 0 new accepting states 107.32/64.48 [2019-03-28 12:24:02,108 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 107.32/64.48 [2019-03-28 12:24:02,110 INFO L70 RemoveSinkStates]: Removed 16 edges and 5 locations by removing sink states 107.32/64.48 [2019-03-28 12:24:02,112 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 107.32/64.48 [2019-03-28 12:24:02,113 INFO L71 MaximizeFinalStates]: 0 new accepting states 107.32/64.48 [2019-03-28 12:24:02,119 INFO L100 BaseMinimizeStates]: Removed 4 edges and 2 locations by large block encoding 107.32/64.48 [2019-03-28 12:24:02,120 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 107.32/64.48 [2019-03-28 12:24:02,120 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 107.32/64.48 [2019-03-28 12:24:02,120 INFO L71 MaximizeFinalStates]: 0 new accepting states 107.32/64.48 [2019-03-28 12:24:02,121 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 107.32/64.48 [2019-03-28 12:24:02,122 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 107.32/64.48 [2019-03-28 12:24:02,122 INFO L313 BlockEncoder]: Encoded RCFG 40 locations, 65 edges 107.32/64.48 [2019-03-28 12:24:02,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:24:02 BasicIcfg 107.32/64.48 [2019-03-28 12:24:02,123 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 107.32/64.48 [2019-03-28 12:24:02,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 107.32/64.48 [2019-03-28 12:24:02,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... 107.32/64.48 [2019-03-28 12:24:02,127 INFO L276 PluginConnector]: TraceAbstraction initialized 107.32/64.48 [2019-03-28 12:24:02,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:24:01" (1/4) ... 107.32/64.48 [2019-03-28 12:24:02,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21157cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (2/4) ... 107.32/64.48 [2019-03-28 12:24:02,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21157cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:24:02" (3/4) ... 107.32/64.48 [2019-03-28 12:24:02,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21157cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:24:02" (4/4) ... 107.32/64.48 [2019-03-28 12:24:02,132 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 107.32/64.48 [2019-03-28 12:24:02,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 107.32/64.48 [2019-03-28 12:24:02,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. 107.32/64.48 [2019-03-28 12:24:02,168 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. 107.32/64.48 [2019-03-28 12:24:02,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation 107.32/64.48 [2019-03-28 12:24:02,199 INFO L382 AbstractCegarLoop]: Interprodecural is true 107.32/64.48 [2019-03-28 12:24:02,199 INFO L383 AbstractCegarLoop]: Hoare is true 107.32/64.48 [2019-03-28 12:24:02,199 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 107.32/64.48 [2019-03-28 12:24:02,199 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 107.32/64.48 [2019-03-28 12:24:02,199 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 107.32/64.48 [2019-03-28 12:24:02,199 INFO L387 AbstractCegarLoop]: Difference is false 107.32/64.48 [2019-03-28 12:24:02,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 107.32/64.48 [2019-03-28 12:24:02,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 107.32/64.48 [2019-03-28 12:24:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. 107.32/64.48 [2019-03-28 12:24:02,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 107.32/64.48 [2019-03-28 12:24:02,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 40 states. 107.32/64.48 [2019-03-28 12:24:02,318 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 35) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,318 INFO L448 ceAbstractionStarter]: For program point L34-1(line 34) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,318 INFO L451 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,319 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 32) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,319 INFO L448 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,319 INFO L448 ceAbstractionStarter]: For program point multiple_ofFINAL(lines 29 43) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,319 INFO L451 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,320 INFO L451 ceAbstractionStarter]: At program point multiple_ofENTRY(lines 29 43) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,320 INFO L448 ceAbstractionStarter]: For program point L42-1(line 42) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,320 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 41) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,320 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 38) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,320 INFO L448 ceAbstractionStarter]: For program point multiple_ofEXIT(lines 29 43) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,320 INFO L451 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,321 INFO L451 ceAbstractionStarter]: At program point L17(line 17) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,321 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 18) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,321 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,321 INFO L451 ceAbstractionStarter]: At program point multENTRY(lines 15 26) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,321 INFO L448 ceAbstractionStarter]: For program point multFINAL(lines 15 26) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,322 INFO L448 ceAbstractionStarter]: For program point multEXIT(lines 15 26) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,322 INFO L451 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,322 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,322 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,322 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 21) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,322 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,322 INFO L448 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,323 INFO L451 ceAbstractionStarter]: At program point L89-1(line 89) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,323 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 87) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,323 INFO L451 ceAbstractionStarter]: At program point L51(line 51) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,323 INFO L451 ceAbstractionStarter]: At program point L51-1(line 51) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,323 INFO L448 ceAbstractionStarter]: For program point is_prime_EXIT(lines 55 72) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,323 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 66 68) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,324 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 70) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,324 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,324 INFO L448 ceAbstractionStarter]: For program point is_prime_FINAL(lines 55 72) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,324 INFO L451 ceAbstractionStarter]: At program point is_prime_ENTRY(lines 55 72) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,324 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 61) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,324 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,325 INFO L451 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,325 INFO L448 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. 107.32/64.48 [2019-03-28 12:24:02,325 INFO L451 ceAbstractionStarter]: At program point L66(line 66) the Hoare annotation is: true 107.32/64.48 [2019-03-28 12:24:02,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:24:02 BasicIcfg 107.32/64.48 [2019-03-28 12:24:02,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 107.32/64.48 [2019-03-28 12:24:02,336 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 107.32/64.48 [2019-03-28 12:24:02,336 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 107.32/64.48 [2019-03-28 12:24:02,340 INFO L276 PluginConnector]: BuchiAutomizer initialized 107.32/64.48 [2019-03-28 12:24:02,341 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 107.32/64.48 [2019-03-28 12:24:02,341 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:24:01" (1/5) ... 107.32/64.48 [2019-03-28 12:24:02,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2632d9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 107.32/64.48 [2019-03-28 12:24:02,342 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:24:01" (2/5) ... 107.32/64.48 [2019-03-28 12:24:02,342 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2632d9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,342 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 107.32/64.48 [2019-03-28 12:24:02,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:24:02" (3/5) ... 107.32/64.48 [2019-03-28 12:24:02,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2632d9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,343 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 107.32/64.48 [2019-03-28 12:24:02,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:24:02" (4/5) ... 107.32/64.48 [2019-03-28 12:24:02,343 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2632d9c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:24:02, skipping insertion in model container 107.32/64.48 [2019-03-28 12:24:02,344 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 107.32/64.48 [2019-03-28 12:24:02,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:24:02" (5/5) ... 107.32/64.48 [2019-03-28 12:24:02,345 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 107.32/64.48 [2019-03-28 12:24:02,372 INFO L133 ementStrategyFactory]: Using default assertion order modulation 107.32/64.48 [2019-03-28 12:24:02,373 INFO L374 BuchiCegarLoop]: Interprodecural is true 107.32/64.48 [2019-03-28 12:24:02,373 INFO L375 BuchiCegarLoop]: Hoare is true 107.32/64.48 [2019-03-28 12:24:02,373 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 107.32/64.48 [2019-03-28 12:24:02,373 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 107.32/64.48 [2019-03-28 12:24:02,373 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 107.32/64.48 [2019-03-28 12:24:02,374 INFO L379 BuchiCegarLoop]: Difference is false 107.32/64.48 [2019-03-28 12:24:02,374 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 107.32/64.48 [2019-03-28 12:24:02,374 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 107.32/64.48 [2019-03-28 12:24:02,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. 107.32/64.48 [2019-03-28 12:24:02,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 107.32/64.48 [2019-03-28 12:24:02,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:02,404 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:02,413 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 107.32/64.48 [2019-03-28 12:24:02,413 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:02,413 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 107.32/64.48 [2019-03-28 12:24:02,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. 107.32/64.48 [2019-03-28 12:24:02,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 107.32/64.48 [2019-03-28 12:24:02,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:02,417 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:02,418 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 107.32/64.48 [2019-03-28 12:24:02,418 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:02,423 INFO L794 eck$LassoCheckResult]: Stem: 33#ULTIMATE.startENTRYtrue [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 11#L51true [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12#is_prime_ENTRYtrue 107.32/64.48 [2019-03-28 12:24:02,424 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 15#L56true [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 6#L59true [214] L59-->L62: Formula: (> 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 30#L62true [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 14#L63true [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 37#L66true [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 40#multiple_ofENTRYtrue [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 36#L30true [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 26#L33true [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 9#L36true [164] L36-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~m_6) (= |v_multiple_of_#res_3| 0)) InVars {multiple_of_~m=v_multiple_of_~m_6} OutVars{multiple_of_~m=v_multiple_of_~m_6, multiple_of_#res=|v_multiple_of_#res_3|} AuxVars[] AssignedVars[multiple_of_#res] 31#multiple_ofFINALtrue [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 29#multiple_ofEXITtrue >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 35#L66-1true [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 27#L69true [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12#is_prime_ENTRYtrue 107.32/64.48 [2019-03-28 12:24:02,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:02,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:02,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1479560046, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:02,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:02,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:02,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:02,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:02,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 107.32/64.48 [2019-03-28 12:24:02,566 INFO L811 eck$LassoCheckResult]: loop already infeasible 107.32/64.48 [2019-03-28 12:24:02,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 107.32/64.48 [2019-03-28 12:24:02,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 107.32/64.48 [2019-03-28 12:24:02,583 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. 107.32/64.48 [2019-03-28 12:24:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.48 [2019-03-28 12:24:02,657 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. 107.32/64.48 [2019-03-28 12:24:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 107.32/64.48 [2019-03-28 12:24:02,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 67 transitions. 107.32/64.48 [2019-03-28 12:24:02,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 107.32/64.48 [2019-03-28 12:24:02,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 60 transitions. 107.32/64.48 [2019-03-28 12:24:02,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 107.32/64.48 [2019-03-28 12:24:02,675 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 107.32/64.48 [2019-03-28 12:24:02,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 60 transitions. 107.32/64.48 [2019-03-28 12:24:02,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 107.32/64.48 [2019-03-28 12:24:02,679 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 60 transitions. 107.32/64.48 [2019-03-28 12:24:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 60 transitions. 107.32/64.48 [2019-03-28 12:24:02,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. 107.32/64.48 [2019-03-28 12:24:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. 107.32/64.48 [2019-03-28 12:24:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 57 transitions. 107.32/64.48 [2019-03-28 12:24:02,714 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 57 transitions. 107.32/64.48 [2019-03-28 12:24:02,714 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 57 transitions. 107.32/64.48 [2019-03-28 12:24:02,714 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 107.32/64.48 [2019-03-28 12:24:02,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 57 transitions. 107.32/64.48 [2019-03-28 12:24:02,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 107.32/64.48 [2019-03-28 12:24:02,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:02,716 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:02,717 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 107.32/64.48 [2019-03-28 12:24:02,717 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:02,717 INFO L794 eck$LassoCheckResult]: Stem: 124#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 105#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 113#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:02,718 INFO L796 eck$LassoCheckResult]: Loop: 113#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 114#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 103#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 107#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 116#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 93#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 102#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 125#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 121#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 111#L36 [164] L36-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~m_6) (= |v_multiple_of_#res_3| 0)) InVars {multiple_of_~m=v_multiple_of_~m_6} OutVars{multiple_of_~m=v_multiple_of_~m_6, multiple_of_#res=|v_multiple_of_#res_3|} AuxVars[] AssignedVars[multiple_of_#res] 96#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 122#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 123#L66-1 [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 104#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 113#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:02,718 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 2 times 107.32/64.48 [2019-03-28 12:24:02,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:02,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:02,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1350477327, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:02,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:02,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:02,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:02,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 107.32/64.48 [2019-03-28 12:24:02,783 INFO L811 eck$LassoCheckResult]: loop already infeasible 107.32/64.48 [2019-03-28 12:24:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.48 [2019-03-28 12:24:02,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 107.32/64.48 [2019-03-28 12:24:02,784 INFO L87 Difference]: Start difference. First operand 36 states and 57 transitions. cyclomatic complexity: 24 Second operand 5 states. 107.32/64.48 [2019-03-28 12:24:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.48 [2019-03-28 12:24:02,996 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. 107.32/64.48 [2019-03-28 12:24:02,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 107.32/64.48 [2019-03-28 12:24:02,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 80 transitions. 107.32/64.48 [2019-03-28 12:24:03,001 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 107.32/64.48 [2019-03-28 12:24:03,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 44 states and 67 transitions. 107.32/64.48 [2019-03-28 12:24:03,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 107.32/64.48 [2019-03-28 12:24:03,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 107.32/64.48 [2019-03-28 12:24:03,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 67 transitions. 107.32/64.48 [2019-03-28 12:24:03,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 107.32/64.48 [2019-03-28 12:24:03,005 INFO L706 BuchiCegarLoop]: Abstraction has 44 states and 67 transitions. 107.32/64.48 [2019-03-28 12:24:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 67 transitions. 107.32/64.48 [2019-03-28 12:24:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. 107.32/64.48 [2019-03-28 12:24:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 107.32/64.48 [2019-03-28 12:24:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. 107.32/64.48 [2019-03-28 12:24:03,010 INFO L729 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. 107.32/64.48 [2019-03-28 12:24:03,010 INFO L609 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. 107.32/64.48 [2019-03-28 12:24:03,010 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 107.32/64.48 [2019-03-28 12:24:03,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. 107.32/64.48 [2019-03-28 12:24:03,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 107.32/64.48 [2019-03-28 12:24:03,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:03,012 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:03,012 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 107.32/64.48 [2019-03-28 12:24:03,013 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:03,013 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 201#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 210#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:03,014 INFO L796 eck$LassoCheckResult]: Loop: 210#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 211#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 200#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 204#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 213#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 187#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 216#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 226#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 224#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 225#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 227#L39 [183] L39-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~n_6) (= |v_multiple_of_#res_4| 1)) InVars {multiple_of_~n=v_multiple_of_~n_6} OutVars{multiple_of_~n=v_multiple_of_~n_6, multiple_of_#res=|v_multiple_of_#res_4|} AuxVars[] AssignedVars[multiple_of_#res] 191#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 219#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 220#L66-1 [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 202#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 210#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:03,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 3 times 107.32/64.48 [2019-03-28 12:24:03,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1405865878, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:03,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:03,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 107.32/64.48 [2019-03-28 12:24:03,063 INFO L811 eck$LassoCheckResult]: loop already infeasible 107.32/64.48 [2019-03-28 12:24:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.48 [2019-03-28 12:24:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 107.32/64.48 [2019-03-28 12:24:03,063 INFO L87 Difference]: Start difference. First operand 42 states and 64 transitions. cyclomatic complexity: 25 Second operand 5 states. 107.32/64.48 [2019-03-28 12:24:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.48 [2019-03-28 12:24:03,189 INFO L93 Difference]: Finished difference Result 49 states and 74 transitions. 107.32/64.48 [2019-03-28 12:24:03,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 107.32/64.48 [2019-03-28 12:24:03,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 74 transitions. 107.32/64.48 [2019-03-28 12:24:03,192 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 107.32/64.48 [2019-03-28 12:24:03,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 74 transitions. 107.32/64.48 [2019-03-28 12:24:03,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 107.32/64.48 [2019-03-28 12:24:03,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 107.32/64.48 [2019-03-28 12:24:03,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 74 transitions. 107.32/64.48 [2019-03-28 12:24:03,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 107.32/64.48 [2019-03-28 12:24:03,196 INFO L706 BuchiCegarLoop]: Abstraction has 49 states and 74 transitions. 107.32/64.48 [2019-03-28 12:24:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 74 transitions. 107.32/64.48 [2019-03-28 12:24:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. 107.32/64.48 [2019-03-28 12:24:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. 107.32/64.48 [2019-03-28 12:24:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. 107.32/64.48 [2019-03-28 12:24:03,202 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 70 transitions. 107.32/64.48 [2019-03-28 12:24:03,202 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 70 transitions. 107.32/64.48 [2019-03-28 12:24:03,203 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ 107.32/64.48 [2019-03-28 12:24:03,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 70 transitions. 107.32/64.48 [2019-03-28 12:24:03,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 107.32/64.48 [2019-03-28 12:24:03,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:03,204 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:03,205 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 107.32/64.48 [2019-03-28 12:24:03,205 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:03,206 INFO L794 eck$LassoCheckResult]: Stem: 323#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 303#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 312#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:03,207 INFO L796 eck$LassoCheckResult]: Loop: 312#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 313#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 302#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 306#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 315#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 291#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 318#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 330#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 327#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 328#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 332#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 288#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 318#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 330#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 327#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 328#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 332#L39 [183] L39-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~n_6) (= |v_multiple_of_#res_4| 1)) InVars {multiple_of_~n=v_multiple_of_~n_6} OutVars{multiple_of_~n=v_multiple_of_~n_6, multiple_of_#res=|v_multiple_of_#res_4|} AuxVars[] AssignedVars[multiple_of_#res] 293#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 321#multiple_ofEXIT >[186] multiple_ofEXIT-->L42-1: AOR: Formula: (= |v_multiple_of_#t~ret4_4| |v_multiple_of_#resOutParam_3|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_4|} AuxVars[] AssignedVars[multiple_of_#t~ret4] LVA: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 322#L42-1 [135] L42-1-->multiple_ofFINAL: Formula: (= |v_multiple_of_#res_5| |v_multiple_of_#t~ret4_3|) InVars {multiple_of_#t~ret4=|v_multiple_of_#t~ret4_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_2|, multiple_of_#res=|v_multiple_of_#res_5|} AuxVars[] AssignedVars[multiple_of_#t~ret4, multiple_of_#res] 331#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 329#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 324#L66-1 [232] L66-1-->L69: Formula: (> 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 304#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 312#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 4 times 107.32/64.48 [2019-03-28 12:24:03,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash 564447436, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:03,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:03,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:03,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 107.32/64.48 [2019-03-28 12:24:03,265 INFO L811 eck$LassoCheckResult]: loop already infeasible 107.32/64.48 [2019-03-28 12:24:03,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.48 [2019-03-28 12:24:03,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 107.32/64.48 [2019-03-28 12:24:03,266 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. cyclomatic complexity: 27 Second operand 5 states. 107.32/64.48 [2019-03-28 12:24:03,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.48 [2019-03-28 12:24:03,335 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 107.32/64.48 [2019-03-28 12:24:03,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 107.32/64.48 [2019-03-28 12:24:03,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 107.32/64.48 [2019-03-28 12:24:03,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 107.32/64.48 [2019-03-28 12:24:03,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 107.32/64.48 [2019-03-28 12:24:03,342 INFO L706 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. 107.32/64.48 [2019-03-28 12:24:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. 107.32/64.48 [2019-03-28 12:24:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,349 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,349 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,349 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ 107.32/64.48 [2019-03-28 12:24:03,349 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 82 transitions. 107.32/64.48 [2019-03-28 12:24:03,351 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 107.32/64.48 [2019-03-28 12:24:03,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:03,351 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:03,352 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] 107.32/64.48 [2019-03-28 12:24:03,352 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:03,352 INFO L794 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 410#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 419#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:03,353 INFO L796 eck$LassoCheckResult]: Loop: 419#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 420#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 409#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 413#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 422#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 398#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 426#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 441#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 439#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 440#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 444#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 399#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 426#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 441#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 439#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 440#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 444#L39 [183] L39-->multiple_ofFINAL: Formula: (and (= 0 v_multiple_of_~n_6) (= |v_multiple_of_#res_4| 1)) InVars {multiple_of_~n=v_multiple_of_~n_6} OutVars{multiple_of_~n=v_multiple_of_~n_6, multiple_of_#res=|v_multiple_of_#res_4|} AuxVars[] AssignedVars[multiple_of_#res] 424#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 429#multiple_ofEXIT >[186] multiple_ofEXIT-->L42-1: AOR: Formula: (= |v_multiple_of_#t~ret4_4| |v_multiple_of_#resOutParam_3|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_4|} AuxVars[] AssignedVars[multiple_of_#t~ret4] LVA: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 430#L42-1 [135] L42-1-->multiple_ofFINAL: Formula: (= |v_multiple_of_#res_5| |v_multiple_of_#t~ret4_3|) InVars {multiple_of_#t~ret4=|v_multiple_of_#t~ret4_3|} OutVars{multiple_of_#t~ret4=|v_multiple_of_#t~ret4_2|, multiple_of_#res=|v_multiple_of_#res_5|} AuxVars[] AssignedVars[multiple_of_#t~ret4, multiple_of_#res] 446#multiple_ofFINAL [150] multiple_ofFINAL-->multiple_ofEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 445#multiple_ofEXIT >[191] multiple_ofEXIT-->L66-1: AOR: Formula: (= |v_is_prime__#t~ret6_6| |v_multiple_of_#resOutParam_4|) InVars {multiple_of_#res=|v_multiple_of_#resOutParam_4|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_6|} AuxVars[] AssignedVars[is_prime__#t~ret6] LVA: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n] 432#L66-1 [233] L66-1-->L69: Formula: (< 0 |v_is_prime__#t~ret6_5|) InVars {is_prime__#t~ret6=|v_is_prime__#t~ret6_5|} OutVars{is_prime__#t~ret6=|v_is_prime__#t~ret6_4|} AuxVars[] AssignedVars[is_prime__#t~ret6] 411#L69 [144] L69-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~nInParam_2| v_is_prime__~n_11) (= |v_is_prime__#in~mInParam_2| (+ v_is_prime__~m_7 (- 1)))) InVars {is_prime__~n=v_is_prime__~n_11, is_prime__~m=v_is_prime__~m_7} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_2|, is_prime__#in~n=|v_is_prime__#in~nInParam_2|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 419#is_prime_ENTRY 107.32/64.48 [2019-03-28 12:24:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,354 INFO L82 PathProgramCache]: Analyzing trace with hash 8562, now seen corresponding path program 5 times 107.32/64.48 [2019-03-28 12:24:03,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 564447467, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:03,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:03,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:03,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1260132516, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:03,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:03,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:03,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 107.32/64.48 [2019-03-28 12:24:03,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 107.32/64.48 [2019-03-28 12:24:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:03,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core 107.32/64.48 [2019-03-28 12:24:03,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.48 [2019-03-28 12:24:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 107.32/64.48 [2019-03-28 12:24:03,878 INFO L216 LassoAnalysis]: Preferences: 107.32/64.48 [2019-03-28 12:24:03,880 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.48 [2019-03-28 12:24:03,880 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.48 [2019-03-28 12:24:03,880 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.48 [2019-03-28 12:24:03,880 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.32/64.48 [2019-03-28 12:24:03,880 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:03,881 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.48 [2019-03-28 12:24:03,881 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.48 [2019-03-28 12:24:03,881 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 107.32/64.48 [2019-03-28 12:24:03,881 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.48 [2019-03-28 12:24:03,881 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.48 [2019-03-28 12:24:03,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:03,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:03,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:03,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:03,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:03,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:03,972 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.48 [2019-03-28 12:24:03,973 INFO L412 LassoAnalysis]: Checking for nontermination... 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:03,979 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:03,979 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:03,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:03,988 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:04,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:04,016 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:04,019 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:04,020 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:04,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:04,047 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:04,051 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:04,051 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret6=0} Honda state: {is_prime__#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:04,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:04,090 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:04,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:04,095 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret7=0} Honda state: {is_prime__#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:04,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:04,125 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:04,157 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:04,157 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:04,200 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 107.32/64.48 [2019-03-28 12:24:04,204 INFO L216 LassoAnalysis]: Preferences: 107.32/64.48 [2019-03-28 12:24:04,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.48 [2019-03-28 12:24:04,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.48 [2019-03-28 12:24:04,204 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.48 [2019-03-28 12:24:04,204 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.32/64.48 [2019-03-28 12:24:04,204 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:04,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.48 [2019-03-28 12:24:04,205 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.48 [2019-03-28 12:24:04,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop 107.32/64.48 [2019-03-28 12:24:04,205 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.48 [2019-03-28 12:24:04,205 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.48 [2019-03-28 12:24:04,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:04,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:04,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:04,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:04,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:04,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:04,272 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.48 [2019-03-28 12:24:04,278 INFO L497 LassoAnalysis]: Using template 'affine'. 107.32/64.48 [2019-03-28 12:24:04,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:04,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:04,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:04,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:04,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:04,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:04,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:04,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:04,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:04,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:04,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:04,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:04,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:04,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:04,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:04,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:04,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:04,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:04,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:04,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:04,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:04,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:04,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:04,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:04,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:04,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:04,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:04,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:04,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:04,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:04,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:04,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:04,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:04,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:04,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:04,301 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.32/64.48 [2019-03-28 12:24:04,311 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 107.32/64.48 [2019-03-28 12:24:04,311 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. 107.32/64.48 [2019-03-28 12:24:04,314 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.32/64.48 [2019-03-28 12:24:04,314 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.32/64.48 [2019-03-28 12:24:04,314 INFO L518 LassoAnalysis]: Proved termination. 107.32/64.48 [2019-03-28 12:24:04,315 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.32/64.48 Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m 107.32/64.48 Supporting invariants [] 107.32/64.48 [2019-03-28 12:24:04,316 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.32/64.48 [2019-03-28 12:24:04,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:04,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core 107.32/64.48 [2019-03-28 12:24:04,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.48 [2019-03-28 12:24:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:04,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core 107.32/64.48 [2019-03-28 12:24:04,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.48 [2019-03-28 12:24:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:04,645 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.32/64.48 [2019-03-28 12:24:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:04,673 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.32/64.48 [2019-03-28 12:24:04,673 INFO L98 LoopCannibalizer]: 9 predicates before loop cannibalization 9 predicates after loop cannibalization 107.32/64.48 [2019-03-28 12:24:04,677 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 9 loop predicates 107.32/64.48 [2019-03-28 12:24:04,677 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 53 states and 82 transitions. cyclomatic complexity: 32 Second operand 10 states. 107.32/64.48 [2019-03-28 12:24:05,265 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 53 states and 82 transitions. cyclomatic complexity: 32. Second operand 10 states. Result 324 states and 509 transitions. Complement of second has 50 states. 107.32/64.48 [2019-03-28 12:24:05,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states 107.32/64.48 [2019-03-28 12:24:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. 107.32/64.48 [2019-03-28 12:24:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. 107.32/64.48 [2019-03-28 12:24:05,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 2 letters. Loop has 24 letters. 107.32/64.48 [2019-03-28 12:24:05,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.48 [2019-03-28 12:24:05,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 26 letters. Loop has 24 letters. 107.32/64.48 [2019-03-28 12:24:05,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.48 [2019-03-28 12:24:05,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 2 letters. Loop has 48 letters. 107.32/64.48 [2019-03-28 12:24:05,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.48 [2019-03-28 12:24:05,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 324 states and 509 transitions. 107.32/64.48 [2019-03-28 12:24:05,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 107.32/64.48 [2019-03-28 12:24:05,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 324 states to 246 states and 374 transitions. 107.32/64.48 [2019-03-28 12:24:05,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 107.32/64.48 [2019-03-28 12:24:05,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 107.32/64.48 [2019-03-28 12:24:05,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 374 transitions. 107.32/64.48 [2019-03-28 12:24:05,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.48 [2019-03-28 12:24:05,305 INFO L706 BuchiCegarLoop]: Abstraction has 246 states and 374 transitions. 107.32/64.48 [2019-03-28 12:24:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 374 transitions. 107.32/64.48 [2019-03-28 12:24:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 139. 107.32/64.48 [2019-03-28 12:24:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. 107.32/64.48 [2019-03-28 12:24:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:05,328 INFO L729 BuchiCegarLoop]: Abstraction has 139 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:05,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. 107.32/64.48 [2019-03-28 12:24:05,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 107.32/64.48 [2019-03-28 12:24:05,328 INFO L87 Difference]: Start difference. First operand 139 states and 200 transitions. Second operand 9 states. 107.32/64.48 [2019-03-28 12:24:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.48 [2019-03-28 12:24:05,594 INFO L93 Difference]: Finished difference Result 225 states and 340 transitions. 107.32/64.48 [2019-03-28 12:24:05,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 107.32/64.48 [2019-03-28 12:24:05,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 340 transitions. 107.32/64.48 [2019-03-28 12:24:05,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 107.32/64.48 [2019-03-28 12:24:05,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 216 states and 328 transitions. 107.32/64.48 [2019-03-28 12:24:05,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 107.32/64.48 [2019-03-28 12:24:05,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 107.32/64.48 [2019-03-28 12:24:05,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 328 transitions. 107.32/64.48 [2019-03-28 12:24:05,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.48 [2019-03-28 12:24:05,613 INFO L706 BuchiCegarLoop]: Abstraction has 216 states and 328 transitions. 107.32/64.48 [2019-03-28 12:24:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 328 transitions. 107.32/64.48 [2019-03-28 12:24:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. 107.32/64.48 [2019-03-28 12:24:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. 107.32/64.48 [2019-03-28 12:24:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 212 transitions. 107.32/64.48 [2019-03-28 12:24:05,630 INFO L729 BuchiCegarLoop]: Abstraction has 148 states and 212 transitions. 107.32/64.48 [2019-03-28 12:24:05,630 INFO L609 BuchiCegarLoop]: Abstraction has 148 states and 212 transitions. 107.32/64.48 [2019-03-28 12:24:05,630 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ 107.32/64.48 [2019-03-28 12:24:05,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 212 transitions. 107.32/64.48 [2019-03-28 12:24:05,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 107.32/64.48 [2019-03-28 12:24:05,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:05,632 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:05,633 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:05,633 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 107.32/64.48 [2019-03-28 12:24:05,633 INFO L794 eck$LassoCheckResult]: Stem: 1471#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 1436#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 1437#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 1439#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 1488#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 1489#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 1491#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 1416#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 1479#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 1520#L30 [156] L30-->L31: Formula: (< v_multiple_of_~m_2 0) InVars {multiple_of_~m=v_multiple_of_~m_2} OutVars{multiple_of_~m=v_multiple_of_~m_2} AuxVars[] AssignedVars[] 1451#L31 107.32/64.48 [2019-03-28 12:24:05,634 INFO L796 eck$LassoCheckResult]: Loop: 1451#L31 [138] L31-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_1| (- v_multiple_of_~m_9)) (= |v_multiple_of_#in~nInParam_1| v_multiple_of_~n_9)) InVars {multiple_of_~m=v_multiple_of_~m_9, multiple_of_~n=v_multiple_of_~n_9} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_1|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_1|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 1456#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 1534#L30 [156] L30-->L31: Formula: (< v_multiple_of_~m_2 0) InVars {multiple_of_~m=v_multiple_of_~m_2} OutVars{multiple_of_~m=v_multiple_of_~m_2} AuxVars[] AssignedVars[] 1451#L31 107.32/64.48 [2019-03-28 12:24:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -122927766, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:05,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:05,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:05,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:05,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 107.32/64.48 [2019-03-28 12:24:05,672 INFO L799 eck$LassoCheckResult]: stem already infeasible 107.32/64.48 [2019-03-28 12:24:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash 168300, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:05,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:05,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:05,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:05,737 INFO L216 LassoAnalysis]: Preferences: 107.32/64.48 [2019-03-28 12:24:05,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.48 [2019-03-28 12:24:05,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.48 [2019-03-28 12:24:05,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.48 [2019-03-28 12:24:05,737 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.32/64.48 [2019-03-28 12:24:05,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.48 [2019-03-28 12:24:05,738 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.48 [2019-03-28 12:24:05,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 107.32/64.48 [2019-03-28 12:24:05,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.48 [2019-03-28 12:24:05,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.48 [2019-03-28 12:24:05,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:05,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:05,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:05,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:05,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:05,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:05,792 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.48 [2019-03-28 12:24:05,793 INFO L412 LassoAnalysis]: Checking for nontermination... 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:05,796 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:05,800 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:05,800 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret4=0} Honda state: {multiple_of_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,827 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:05,827 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:05,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:05,832 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=4, multiple_of_#in~n=4} Honda state: {multiple_of_~n=4, multiple_of_#in~n=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,859 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:05,859 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:05,862 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:05,863 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:05,891 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:05,894 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.48 [2019-03-28 12:24:05,894 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:05,921 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.48 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.48 Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:05,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.32/64.48 [2019-03-28 12:24:05,955 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.48 [2019-03-28 12:24:07,114 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 107.32/64.48 [2019-03-28 12:24:07,117 INFO L216 LassoAnalysis]: Preferences: 107.32/64.48 [2019-03-28 12:24:07,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.48 [2019-03-28 12:24:07,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.48 [2019-03-28 12:24:07,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.48 [2019-03-28 12:24:07,118 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.32/64.48 [2019-03-28 12:24:07,118 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.32/64.48 [2019-03-28 12:24:07,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.48 [2019-03-28 12:24:07,118 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.48 [2019-03-28 12:24:07,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop 107.32/64.48 [2019-03-28 12:24:07,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.48 [2019-03-28 12:24:07,118 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.48 [2019-03-28 12:24:07,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:07,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:07,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:07,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:07,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:07,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.48 [2019-03-28 12:24:07,174 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.48 [2019-03-28 12:24:07,174 INFO L497 LassoAnalysis]: Using template 'affine'. 107.32/64.48 [2019-03-28 12:24:07,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:07,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:07,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:07,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:07,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:07,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:07,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:07,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:07,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:07,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:07,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:07,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:07,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:07,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:07,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:07,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:07,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:07,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:07,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:07,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:07,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:07,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:07,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:07,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:07,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:07,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:07,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:07,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:07,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:07,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:07,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:07,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:07,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:07,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:07,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:07,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.48 [2019-03-28 12:24:07,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.48 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.48 Number of strict supporting invariants: 0 107.32/64.48 Number of non-strict supporting invariants: 1 107.32/64.48 Consider only non-deceasing supporting invariants: true 107.32/64.48 Simplify termination arguments: true 107.32/64.48 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.48 [2019-03-28 12:24:07,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.48 [2019-03-28 12:24:07,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.48 [2019-03-28 12:24:07,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.48 [2019-03-28 12:24:07,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.48 [2019-03-28 12:24:07,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.48 [2019-03-28 12:24:07,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.48 [2019-03-28 12:24:07,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.48 [2019-03-28 12:24:07,193 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.32/64.48 [2019-03-28 12:24:07,195 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 107.32/64.48 [2019-03-28 12:24:07,195 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. 107.32/64.48 [2019-03-28 12:24:07,196 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.32/64.48 [2019-03-28 12:24:07,196 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.32/64.48 [2019-03-28 12:24:07,196 INFO L518 LassoAnalysis]: Proved termination. 107.32/64.48 [2019-03-28 12:24:07,196 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.32/64.48 Ranking function f(multiple_of_~m) = 1*multiple_of_~m 107.32/64.48 Supporting invariants [] 107.32/64.48 [2019-03-28 12:24:07,197 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.32/64.48 [2019-03-28 12:24:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:07,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core 107.32/64.48 [2019-03-28 12:24:07,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.48 [2019-03-28 12:24:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:07,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core 107.32/64.48 [2019-03-28 12:24:07,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.48 [2019-03-28 12:24:07,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.48 [2019-03-28 12:24:07,274 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.32/64.48 [2019-03-28 12:24:07,275 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 107.32/64.48 [2019-03-28 12:24:07,275 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 107.32/64.48 [2019-03-28 12:24:07,275 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 148 states and 212 transitions. cyclomatic complexity: 68 Second operand 4 states. 107.32/64.48 [2019-03-28 12:24:07,428 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 148 states and 212 transitions. cyclomatic complexity: 68. Second operand 4 states. Result 392 states and 587 transitions. Complement of second has 53 states. 107.32/64.48 [2019-03-28 12:24:07,429 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 107.32/64.48 [2019-03-28 12:24:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 107.32/64.48 [2019-03-28 12:24:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. 107.32/64.48 [2019-03-28 12:24:07,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 10 letters. Loop has 3 letters. 107.32/64.48 [2019-03-28 12:24:07,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.48 [2019-03-28 12:24:07,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 13 letters. Loop has 3 letters. 107.32/64.48 [2019-03-28 12:24:07,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.48 [2019-03-28 12:24:07,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 10 letters. Loop has 6 letters. 107.32/64.48 [2019-03-28 12:24:07,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.48 [2019-03-28 12:24:07,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 392 states and 587 transitions. 107.32/64.48 [2019-03-28 12:24:07,442 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 106 107.32/64.48 [2019-03-28 12:24:07,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 392 states to 240 states and 345 transitions. 107.32/64.48 [2019-03-28 12:24:07,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 107.32/64.48 [2019-03-28 12:24:07,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 107.32/64.48 [2019-03-28 12:24:07,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 240 states and 345 transitions. 107.32/64.48 [2019-03-28 12:24:07,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.48 [2019-03-28 12:24:07,448 INFO L706 BuchiCegarLoop]: Abstraction has 240 states and 345 transitions. 107.32/64.48 [2019-03-28 12:24:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states and 345 transitions. 107.32/64.48 [2019-03-28 12:24:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. 107.32/64.48 [2019-03-28 12:24:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. 107.32/64.48 [2019-03-28 12:24:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. 107.32/64.48 [2019-03-28 12:24:07,459 INFO L729 BuchiCegarLoop]: Abstraction has 163 states and 235 transitions. 107.32/64.48 [2019-03-28 12:24:07,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.48 [2019-03-28 12:24:07,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 107.32/64.48 [2019-03-28 12:24:07,460 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand 5 states. 107.32/64.48 [2019-03-28 12:24:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.48 [2019-03-28 12:24:07,567 INFO L93 Difference]: Finished difference Result 144 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:07,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 107.32/64.48 [2019-03-28 12:24:07,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:07,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 107.32/64.48 [2019-03-28 12:24:07,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:07,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 107.32/64.48 [2019-03-28 12:24:07,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 107.32/64.48 [2019-03-28 12:24:07,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:07,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.48 [2019-03-28 12:24:07,577 INFO L706 BuchiCegarLoop]: Abstraction has 144 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 200 transitions. 107.32/64.48 [2019-03-28 12:24:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. 107.32/64.48 [2019-03-28 12:24:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. 107.32/64.48 [2019-03-28 12:24:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 195 transitions. 107.32/64.48 [2019-03-28 12:24:07,585 INFO L729 BuchiCegarLoop]: Abstraction has 140 states and 195 transitions. 107.32/64.48 [2019-03-28 12:24:07,585 INFO L609 BuchiCegarLoop]: Abstraction has 140 states and 195 transitions. 107.32/64.48 [2019-03-28 12:24:07,585 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ 107.32/64.48 [2019-03-28 12:24:07,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 195 transitions. 107.32/64.48 [2019-03-28 12:24:07,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 107.32/64.48 [2019-03-28 12:24:07,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.48 [2019-03-28 12:24:07,587 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.48 [2019-03-28 12:24:07,587 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.48 [2019-03-28 12:24:07,587 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] 107.32/64.48 [2019-03-28 12:24:07,588 INFO L794 eck$LassoCheckResult]: Stem: 2432#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 2384#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 2400#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 2402#L56 [173] L56-->is_prime_FINAL: Formula: (and (<= v_is_prime__~n_5 1) (= |v_is_prime__#res_3| 0)) InVars {is_prime__~n=v_is_prime__~n_5} OutVars{is_prime__~n=v_is_prime__~n_5, is_prime__#res=|v_is_prime__#res_3|} AuxVars[] AssignedVars[is_prime__#res] 2385#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2442#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 2392#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 2393#L85 [222] L85-->L89: Formula: (and (not |v_ULTIMATE.start_main_#t~short13_9|) (>= v_ULTIMATE.start_main_~f1~0_9 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9) (> v_ULTIMATE.start_main_~result~0_3 1)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 2406#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 2376#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 2391#multENTRY 107.32/64.48 [2019-03-28 12:24:07,588 INFO L796 eck$LassoCheckResult]: Loop: 2391#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 2374#L16 [125] L16-->L17: Formula: (< v_mult_~m_7 0) InVars {mult_~m=v_mult_~m_7} OutVars{mult_~m=v_mult_~m_7} AuxVars[] AssignedVars[] 2375#L17 [179] L17-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_1| v_mult_~n_5) (= |v_mult_#in~mInParam_1| (- v_mult_~m_10))) InVars {mult_~n=v_mult_~n_5, mult_~m=v_mult_~m_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_1|, mult_#in~n=|v_mult_#in~nInParam_1|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 2391#multENTRY 107.32/64.48 [2019-03-28 12:24:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -592378520, now seen corresponding path program 1 times 107.32/64.48 [2019-03-28 12:24:07,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.48 [2019-03-28 12:24:07,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.48 [2019-03-28 12:24:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:07,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:07,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.48 [2019-03-28 12:24:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.48 [2019-03-28 12:24:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.48 [2019-03-28 12:24:07,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.48 [2019-03-28 12:24:07,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 107.32/64.48 [2019-03-28 12:24:07,607 INFO L799 eck$LassoCheckResult]: stem already infeasible 107.32/64.48 [2019-03-28 12:24:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.48 [2019-03-28 12:24:07,607 INFO L82 PathProgramCache]: Analyzing trace with hash 206825, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:07,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:07,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:07,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:07,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:07,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:07,645 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:07,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:07,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:07,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:07,645 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.32/64.49 [2019-03-28 12:24:07,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,646 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:07,646 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:07,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 107.32/64.49 [2019-03-28 12:24:07,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:07,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:07,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,704 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:07,704 INFO L412 LassoAnalysis]: Checking for nontermination... 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,708 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:07,711 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,738 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,741 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:07,742 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,768 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,769 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:07,772 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,799 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,799 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:07,803 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,830 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,830 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,833 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:07,833 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,861 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,865 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:07,865 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,892 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:07,923 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:07,959 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 107.32/64.49 [2019-03-28 12:24:07,961 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:07,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:07,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:07,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:07,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.32/64.49 [2019-03-28 12:24:07,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:07,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:07,962 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:07,962 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop 107.32/64.49 [2019-03-28 12:24:07,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:07,962 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:07,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:07,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,008 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:08,009 INFO L497 LassoAnalysis]: Using template 'affine'. 107.32/64.49 [2019-03-28 12:24:08,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,028 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.32/64.49 [2019-03-28 12:24:08,030 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 107.32/64.49 [2019-03-28 12:24:08,030 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 107.32/64.49 [2019-03-28 12:24:08,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.32/64.49 [2019-03-28 12:24:08,031 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.32/64.49 [2019-03-28 12:24:08,031 INFO L518 LassoAnalysis]: Proved termination. 107.32/64.49 [2019-03-28 12:24:08,031 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.32/64.49 Ranking function f(mult_#in~m) = -1*mult_#in~m 107.32/64.49 Supporting invariants [] 107.32/64.49 [2019-03-28 12:24:08,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.32/64.49 [2019-03-28 12:24:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:08,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:08,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:08,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:08,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:08,122 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 107.32/64.49 [2019-03-28 12:24:08,122 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates 107.32/64.49 [2019-03-28 12:24:08,122 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 140 states and 195 transitions. cyclomatic complexity: 59 Second operand 7 states. 107.32/64.49 [2019-03-28 12:24:08,223 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 140 states and 195 transitions. cyclomatic complexity: 59. Second operand 7 states. Result 186 states and 257 transitions. Complement of second has 18 states. 107.32/64.49 [2019-03-28 12:24:08,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states 107.32/64.49 [2019-03-28 12:24:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 107.32/64.49 [2019-03-28 12:24:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. 107.32/64.49 [2019-03-28 12:24:08,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 72 transitions. Stem has 10 letters. Loop has 3 letters. 107.32/64.49 [2019-03-28 12:24:08,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:08,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 72 transitions. Stem has 13 letters. Loop has 3 letters. 107.32/64.49 [2019-03-28 12:24:08,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:08,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 72 transitions. Stem has 10 letters. Loop has 6 letters. 107.32/64.49 [2019-03-28 12:24:08,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:08,228 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 257 transitions. 107.32/64.49 [2019-03-28 12:24:08,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 107.32/64.49 [2019-03-28 12:24:08,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 158 states and 217 transitions. 107.32/64.49 [2019-03-28 12:24:08,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 107.32/64.49 [2019-03-28 12:24:08,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 107.32/64.49 [2019-03-28 12:24:08,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 217 transitions. 107.32/64.49 [2019-03-28 12:24:08,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:08,234 INFO L706 BuchiCegarLoop]: Abstraction has 158 states and 217 transitions. 107.32/64.49 [2019-03-28 12:24:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 217 transitions. 107.32/64.49 [2019-03-28 12:24:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. 107.32/64.49 [2019-03-28 12:24:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. 107.32/64.49 [2019-03-28 12:24:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,242 INFO L729 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 107.32/64.49 [2019-03-28 12:24:08,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 107.32/64.49 [2019-03-28 12:24:08,242 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand 3 states. 107.32/64.49 [2019-03-28 12:24:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.49 [2019-03-28 12:24:08,280 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 107.32/64.49 [2019-03-28 12:24:08,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 107.32/64.49 [2019-03-28 12:24:08,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 107.32/64.49 [2019-03-28 12:24:08,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 107.32/64.49 [2019-03-28 12:24:08,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:08,289 INFO L706 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. 107.32/64.49 [2019-03-28 12:24:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. 107.32/64.49 [2019-03-28 12:24:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,295 INFO L729 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,296 INFO L609 BuchiCegarLoop]: Abstraction has 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,296 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ 107.32/64.49 [2019-03-28 12:24:08,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 203 transitions. 107.32/64.49 [2019-03-28 12:24:08,297 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 107.32/64.49 [2019-03-28 12:24:08,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.49 [2019-03-28 12:24:08,297 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.49 [2019-03-28 12:24:08,298 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:08,298 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:08,298 INFO L794 eck$LassoCheckResult]: Stem: 3137#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 3092#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 3101#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 3103#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 3150#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 3134#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 3135#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 3082#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 3144#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 3197#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 3196#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 3066#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 3084#multiple_ofENTRY 107.32/64.49 [2019-03-28 12:24:08,299 INFO L796 eck$LassoCheckResult]: Loop: 3084#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 3142#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 3127#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 3062#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 3084#multiple_ofENTRY 107.32/64.49 [2019-03-28 12:24:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2125549897, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:08,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:08,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:08,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:08,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.49 [2019-03-28 12:24:08,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 107.32/64.49 [2019-03-28 12:24:08,347 INFO L799 eck$LassoCheckResult]: stem already infeasible 107.32/64.49 [2019-03-28 12:24:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash 6633507, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:08,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:08,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:08,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:08,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:08,400 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:08,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:08,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:08,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:08,401 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.32/64.49 [2019-03-28 12:24:08,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:08,401 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:08,401 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 107.32/64.49 [2019-03-28 12:24:08,401 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:08,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:08,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,473 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:08,473 INFO L412 LassoAnalysis]: Checking for nontermination... 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:08,480 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:08,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:08,483 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:08,509 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:08,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:08,513 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:08,539 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:08,542 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:08,542 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:08,568 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:08,597 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:08,632 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 107.32/64.49 [2019-03-28 12:24:08,633 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:08,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:08,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:08,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:08,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.32/64.49 [2019-03-28 12:24:08,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:08,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:08,634 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:08,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Loop 107.32/64.49 [2019-03-28 12:24:08,635 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:08,635 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:08,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:08,685 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:08,685 INFO L497 LassoAnalysis]: Using template 'affine'. 107.32/64.49 [2019-03-28 12:24:08,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:08,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:08,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:08,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:08,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:08,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:08,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:08,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:08,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:08,697 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.32/64.49 [2019-03-28 12:24:08,698 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. 107.32/64.49 [2019-03-28 12:24:08,698 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 107.32/64.49 [2019-03-28 12:24:08,698 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.32/64.49 [2019-03-28 12:24:08,699 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.32/64.49 [2019-03-28 12:24:08,699 INFO L518 LassoAnalysis]: Proved termination. 107.32/64.49 [2019-03-28 12:24:08,699 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.32/64.49 Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n 107.32/64.49 Supporting invariants [] 107.32/64.49 [2019-03-28 12:24:08,699 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.32/64.49 [2019-03-28 12:24:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:08,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:08,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:08,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:08,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:08,770 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization 107.32/64.49 [2019-03-28 12:24:08,770 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 107.32/64.49 [2019-03-28 12:24:08,770 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 147 states and 203 transitions. cyclomatic complexity: 61 Second operand 4 states. 107.32/64.49 [2019-03-28 12:24:08,871 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 147 states and 203 transitions. cyclomatic complexity: 61. Second operand 4 states. Result 465 states and 598 transitions. Complement of second has 47 states. 107.32/64.49 [2019-03-28 12:24:08,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states 107.32/64.49 [2019-03-28 12:24:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. 107.32/64.49 [2019-03-28 12:24:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. 107.32/64.49 [2019-03-28 12:24:08,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 12 letters. Loop has 4 letters. 107.32/64.49 [2019-03-28 12:24:08,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:08,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 16 letters. Loop has 4 letters. 107.32/64.49 [2019-03-28 12:24:08,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:08,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 12 letters. Loop has 8 letters. 107.32/64.49 [2019-03-28 12:24:08,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:08,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 465 states and 598 transitions. 107.32/64.49 [2019-03-28 12:24:08,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 107.32/64.49 [2019-03-28 12:24:08,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 465 states to 237 states and 364 transitions. 107.32/64.49 [2019-03-28 12:24:08,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 110 107.32/64.49 [2019-03-28 12:24:08,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 107.32/64.49 [2019-03-28 12:24:08,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 237 states and 364 transitions. 107.32/64.49 [2019-03-28 12:24:08,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:08,887 INFO L706 BuchiCegarLoop]: Abstraction has 237 states and 364 transitions. 107.32/64.49 [2019-03-28 12:24:08,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states and 364 transitions. 107.32/64.49 [2019-03-28 12:24:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 213. 107.32/64.49 [2019-03-28 12:24:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. 107.32/64.49 [2019-03-28 12:24:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 303 transitions. 107.32/64.49 [2019-03-28 12:24:08,897 INFO L729 BuchiCegarLoop]: Abstraction has 213 states and 303 transitions. 107.32/64.49 [2019-03-28 12:24:08,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. 107.32/64.49 [2019-03-28 12:24:08,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 107.32/64.49 [2019-03-28 12:24:08,898 INFO L87 Difference]: Start difference. First operand 213 states and 303 transitions. Second operand 7 states. 107.32/64.49 [2019-03-28 12:24:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.49 [2019-03-28 12:24:09,024 INFO L93 Difference]: Finished difference Result 226 states and 339 transitions. 107.32/64.49 [2019-03-28 12:24:09,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 107.32/64.49 [2019-03-28 12:24:09,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 339 transitions. 107.32/64.49 [2019-03-28 12:24:09,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 107.32/64.49 [2019-03-28 12:24:09,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 339 transitions. 107.32/64.49 [2019-03-28 12:24:09,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 107.32/64.49 [2019-03-28 12:24:09,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 107.32/64.49 [2019-03-28 12:24:09,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 339 transitions. 107.32/64.49 [2019-03-28 12:24:09,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:09,034 INFO L706 BuchiCegarLoop]: Abstraction has 226 states and 339 transitions. 107.32/64.49 [2019-03-28 12:24:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 339 transitions. 107.32/64.49 [2019-03-28 12:24:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 211. 107.32/64.49 [2019-03-28 12:24:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. 107.32/64.49 [2019-03-28 12:24:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. 107.32/64.49 [2019-03-28 12:24:09,043 INFO L729 BuchiCegarLoop]: Abstraction has 211 states and 299 transitions. 107.32/64.49 [2019-03-28 12:24:09,043 INFO L609 BuchiCegarLoop]: Abstraction has 211 states and 299 transitions. 107.32/64.49 [2019-03-28 12:24:09,043 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ 107.32/64.49 [2019-03-28 12:24:09,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 299 transitions. 107.32/64.49 [2019-03-28 12:24:09,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 46 107.32/64.49 [2019-03-28 12:24:09,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.49 [2019-03-28 12:24:09,045 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.49 [2019-03-28 12:24:09,045 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:09,045 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:09,046 INFO L794 eck$LassoCheckResult]: Stem: 4316#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 4275#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 4276#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 4278#L56 [173] L56-->is_prime_FINAL: Formula: (and (<= v_is_prime__~n_5 1) (= |v_is_prime__#res_3| 0)) InVars {is_prime__~n=v_is_prime__~n_5} OutVars{is_prime__~n=v_is_prime__~n_5, is_prime__#res=|v_is_prime__#res_3|} AuxVars[] AssignedVars[is_prime__#res] 4328#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4329#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 4269#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 4270#L85 [220] L85-->L89: Formula: (and |v_ULTIMATE.start_main_#t~short13_9| (>= v_ULTIMATE.start_main_~f1~0_9 1) (= v_ULTIMATE.start_main_~result~0_3 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 4282#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 4250#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4295#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4249#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4252#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 4293#L22 107.32/64.49 [2019-03-28 12:24:09,046 INFO L796 eck$LassoCheckResult]: Loop: 4293#L22 [234] L22-->L25: Formula: (> 1 v_mult_~m_4) InVars {mult_~m=v_mult_~m_4} OutVars{mult_~m=v_mult_~m_4} AuxVars[] AssignedVars[] 4266#L25 [163] L25-->multENTRY: Formula: (and (= |v_mult_#in~mInParam_2| (+ v_mult_~m_11 (- 1))) (= |v_mult_#in~nInParam_2| v_mult_~n_6)) InVars {mult_~n=v_mult_~n_6, mult_~m=v_mult_~m_11} OutVars{mult_#in~m=|v_mult_#in~mInParam_2|, mult_#in~n=|v_mult_#in~nInParam_2|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4268#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4303#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4374#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 4293#L22 107.32/64.49 [2019-03-28 12:24:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 415051269, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:09,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:09,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.49 [2019-03-28 12:24:09,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 107.32/64.49 [2019-03-28 12:24:09,085 INFO L799 eck$LassoCheckResult]: stem already infeasible 107.32/64.49 [2019-03-28 12:24:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:09,086 INFO L82 PathProgramCache]: Analyzing trace with hash 249768625, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:09,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:09,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:09,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.49 [2019-03-28 12:24:09,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 107.32/64.49 [2019-03-28 12:24:09,108 INFO L811 eck$LassoCheckResult]: loop already infeasible 107.32/64.49 [2019-03-28 12:24:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.49 [2019-03-28 12:24:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 107.32/64.49 [2019-03-28 12:24:09,109 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. cyclomatic complexity: 93 Second operand 5 states. 107.32/64.49 [2019-03-28 12:24:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.49 [2019-03-28 12:24:09,171 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. 107.32/64.49 [2019-03-28 12:24:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 107.32/64.49 [2019-03-28 12:24:09,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 305 transitions. 107.32/64.49 [2019-03-28 12:24:09,176 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 107.32/64.49 [2019-03-28 12:24:09,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 217 states and 305 transitions. 107.32/64.49 [2019-03-28 12:24:09,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 107.32/64.49 [2019-03-28 12:24:09,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 107.32/64.49 [2019-03-28 12:24:09,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 305 transitions. 107.32/64.49 [2019-03-28 12:24:09,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:09,180 INFO L706 BuchiCegarLoop]: Abstraction has 217 states and 305 transitions. 107.32/64.49 [2019-03-28 12:24:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 305 transitions. 107.32/64.49 [2019-03-28 12:24:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. 107.32/64.49 [2019-03-28 12:24:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. 107.32/64.49 [2019-03-28 12:24:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 300 transitions. 107.32/64.49 [2019-03-28 12:24:09,188 INFO L729 BuchiCegarLoop]: Abstraction has 213 states and 300 transitions. 107.32/64.49 [2019-03-28 12:24:09,188 INFO L609 BuchiCegarLoop]: Abstraction has 213 states and 300 transitions. 107.32/64.49 [2019-03-28 12:24:09,188 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ 107.32/64.49 [2019-03-28 12:24:09,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 300 transitions. 107.32/64.49 [2019-03-28 12:24:09,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 107.32/64.49 [2019-03-28 12:24:09,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.49 [2019-03-28 12:24:09,190 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.49 [2019-03-28 12:24:09,191 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:09,191 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:09,191 INFO L794 eck$LassoCheckResult]: Stem: 4754#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 4712#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 4713#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 4715#L56 [173] L56-->is_prime_FINAL: Formula: (and (<= v_is_prime__~n_5 1) (= |v_is_prime__#res_3| 0)) InVars {is_prime__~n=v_is_prime__~n_5} OutVars{is_prime__~n=v_is_prime__~n_5, is_prime__#res=|v_is_prime__#res_3|} AuxVars[] AssignedVars[is_prime__#res] 4767#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 4766#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 4705#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 4706#L85 [220] L85-->L89: Formula: (and |v_ULTIMATE.start_main_#t~short13_9| (>= v_ULTIMATE.start_main_~f1~0_9 1) (= v_ULTIMATE.start_main_~result~0_3 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 4719#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 4686#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4738#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4685#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4688#L19 107.32/64.49 [2019-03-28 12:24:09,192 INFO L796 eck$LassoCheckResult]: Loop: 4688#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 4736#L22 [235] L22-->L25: Formula: (< 1 v_mult_~m_4) InVars {mult_~m=v_mult_~m_4} OutVars{mult_~m=v_mult_~m_4} AuxVars[] AssignedVars[] 4702#L25 [163] L25-->multENTRY: Formula: (and (= |v_mult_#in~mInParam_2| (+ v_mult_~m_11 (- 1))) (= |v_mult_#in~nInParam_2| v_mult_~n_6)) InVars {mult_~n=v_mult_~n_6, mult_~m=v_mult_~m_11} OutVars{mult_#in~m=|v_mult_#in~mInParam_2|, mult_#in~n=|v_mult_#in~nInParam_2|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 4704#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 4747#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 4688#L19 107.32/64.49 [2019-03-28 12:24:09,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:09,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1953051393, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:09,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:09,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:09,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.49 [2019-03-28 12:24:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 107.32/64.49 [2019-03-28 12:24:09,222 INFO L799 eck$LassoCheckResult]: stem already infeasible 107.32/64.49 [2019-03-28 12:24:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 248202296, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:09,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:09,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:09,288 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:09,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:09,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:09,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:09,288 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.32/64.49 [2019-03-28 12:24:09,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:09,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:09,289 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:09,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 107.32/64.49 [2019-03-28 12:24:09,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:09,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:09,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:09,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:09,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:09,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:09,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:09,345 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:09,345 INFO L412 LassoAnalysis]: Checking for nontermination... 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 [2019-03-28 12:24:09,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:09,350 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:09,353 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:09,353 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:09,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:09,400 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:09,403 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:09,404 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:09,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:09,430 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:09,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:09,462 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:10,811 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 107.32/64.49 [2019-03-28 12:24:10,813 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:10,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:10,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:10,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:10,831 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.32/64.49 [2019-03-28 12:24:10,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:10,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:10,831 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:10,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Loop 107.32/64.49 [2019-03-28 12:24:10,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:10,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:10,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:10,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:10,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:10,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:10,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:10,883 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:10,884 INFO L497 LassoAnalysis]: Using template 'affine'. 107.32/64.49 [2019-03-28 12:24:10,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:10,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:10,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:10,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:10,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:10,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:10,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:10,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:10,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:10,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:10,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:10,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:10,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:10,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:10,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:10,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:10,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:10,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:10,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:10,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:10,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:10,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:10,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:10,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:10,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:10,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:10,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:10,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:10,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:10,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:10,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:10,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:10,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:10,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:10,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:10,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:10,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:10,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:10,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:10,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:10,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:10,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:10,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:10,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:10,899 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.32/64.49 [2019-03-28 12:24:10,901 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 107.32/64.49 [2019-03-28 12:24:10,901 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. 107.32/64.49 [2019-03-28 12:24:10,901 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.32/64.49 [2019-03-28 12:24:10,901 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.32/64.49 [2019-03-28 12:24:10,902 INFO L518 LassoAnalysis]: Proved termination. 107.32/64.49 [2019-03-28 12:24:10,902 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.32/64.49 Ranking function f(mult_~m) = 1*mult_~m 107.32/64.49 Supporting invariants [] 107.32/64.49 [2019-03-28 12:24:10,902 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.32/64.49 [2019-03-28 12:24:10,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:10,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:10,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:10,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:11,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:11,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,124 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.32/64.49 [2019-03-28 12:24:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:11,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:11,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:11,197 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization 107.32/64.49 [2019-03-28 12:24:11,198 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 7 loop predicates 107.32/64.49 [2019-03-28 12:24:11,198 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 213 states and 300 transitions. cyclomatic complexity: 92 Second operand 6 states. 107.32/64.49 [2019-03-28 12:24:11,354 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 213 states and 300 transitions. cyclomatic complexity: 92. Second operand 6 states. Result 330 states and 450 transitions. Complement of second has 80 states. 107.32/64.49 [2019-03-28 12:24:11,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 4 non-accepting loop states 2 accepting loop states 107.32/64.49 [2019-03-28 12:24:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. 107.32/64.49 [2019-03-28 12:24:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. 107.32/64.49 [2019-03-28 12:24:11,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 12 letters. Loop has 5 letters. 107.32/64.49 [2019-03-28 12:24:11,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:11,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 17 letters. Loop has 5 letters. 107.32/64.49 [2019-03-28 12:24:11,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:11,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 68 transitions. Stem has 12 letters. Loop has 10 letters. 107.32/64.49 [2019-03-28 12:24:11,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.32/64.49 [2019-03-28 12:24:11,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 330 states and 450 transitions. 107.32/64.49 [2019-03-28 12:24:11,362 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 107.32/64.49 [2019-03-28 12:24:11,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 330 states to 227 states and 314 transitions. 107.32/64.49 [2019-03-28 12:24:11,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 107.32/64.49 [2019-03-28 12:24:11,366 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 107.32/64.49 [2019-03-28 12:24:11,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 314 transitions. 107.32/64.49 [2019-03-28 12:24:11,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:11,366 INFO L706 BuchiCegarLoop]: Abstraction has 227 states and 314 transitions. 107.32/64.49 [2019-03-28 12:24:11,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 314 transitions. 107.32/64.49 [2019-03-28 12:24:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. 107.32/64.49 [2019-03-28 12:24:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. 107.32/64.49 [2019-03-28 12:24:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 298 transitions. 107.32/64.49 [2019-03-28 12:24:11,374 INFO L729 BuchiCegarLoop]: Abstraction has 212 states and 298 transitions. 107.32/64.49 [2019-03-28 12:24:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.49 [2019-03-28 12:24:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 107.32/64.49 [2019-03-28 12:24:11,375 INFO L87 Difference]: Start difference. First operand 212 states and 298 transitions. Second operand 5 states. 107.32/64.49 [2019-03-28 12:24:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.49 [2019-03-28 12:24:11,428 INFO L93 Difference]: Finished difference Result 218 states and 304 transitions. 107.32/64.49 [2019-03-28 12:24:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 107.32/64.49 [2019-03-28 12:24:11,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 304 transitions. 107.32/64.49 [2019-03-28 12:24:11,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 107.32/64.49 [2019-03-28 12:24:11,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 213 states and 298 transitions. 107.32/64.49 [2019-03-28 12:24:11,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 107.32/64.49 [2019-03-28 12:24:11,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 107.32/64.49 [2019-03-28 12:24:11,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 213 states and 298 transitions. 107.32/64.49 [2019-03-28 12:24:11,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:11,437 INFO L706 BuchiCegarLoop]: Abstraction has 213 states and 298 transitions. 107.32/64.49 [2019-03-28 12:24:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 298 transitions. 107.32/64.49 [2019-03-28 12:24:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. 107.32/64.49 [2019-03-28 12:24:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. 107.32/64.49 [2019-03-28 12:24:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 295 transitions. 107.32/64.49 [2019-03-28 12:24:11,445 INFO L729 BuchiCegarLoop]: Abstraction has 211 states and 295 transitions. 107.32/64.49 [2019-03-28 12:24:11,445 INFO L609 BuchiCegarLoop]: Abstraction has 211 states and 295 transitions. 107.32/64.49 [2019-03-28 12:24:11,445 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ 107.32/64.49 [2019-03-28 12:24:11,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 295 transitions. 107.32/64.49 [2019-03-28 12:24:11,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 107.32/64.49 [2019-03-28 12:24:11,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.49 [2019-03-28 12:24:11,447 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.49 [2019-03-28 12:24:11,448 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:11,448 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:11,448 INFO L794 eck$LassoCheckResult]: Stem: 5926#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 5879#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 5880#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 5882#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 5942#L59 [161] L59-->is_prime_FINAL: Formula: (and (= |v_is_prime__#res_4| 1) (= 2 v_is_prime__~n_7)) InVars {is_prime__~n=v_is_prime__~n_7} OutVars{is_prime__~n=v_is_prime__~n_7, is_prime__#res=|v_is_prime__#res_4|} AuxVars[] AssignedVars[is_prime__#res] 5941#is_prime_FINAL [160] is_prime_FINAL-->is_prime_EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 5939#is_prime_EXIT >[193] is_prime_EXIT-->L51-1: AOR: Formula: (= |v_ULTIMATE.start_is_prime_#t~ret5_5| |v_is_prime__#resOutParam_1|) InVars {is_prime__#res=|v_is_prime__#resOutParam_1|} OutVars{ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_5|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#t~ret5] LVA: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n] 5873#L51-1 [242] L51-1-->L85: Formula: (and (<= 1 v_ULTIMATE.start_main_~f1~0_13) (= |v_ULTIMATE.start_main_#t~nondet10_8| v_ULTIMATE.start_main_~f1~0_13) (<= v_ULTIMATE.start_main_~f1~0_13 46340) (= v_ULTIMATE.start_main_~result~0_6 |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_is_prime_#t~ret5_10| |v_ULTIMATE.start_is_prime_#res_6|) (= |v_ULTIMATE.start_main_#t~nondet11_6| v_ULTIMATE.start_main_~f2~0_8)) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_8|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_6|, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_10|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_7|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_6|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_6|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_8, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_13, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_6, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_~f2~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_~result~0, ULTIMATE.start_is_prime_#t~ret5] 5874#L85 [220] L85-->L89: Formula: (and |v_ULTIMATE.start_main_#t~short13_9| (>= v_ULTIMATE.start_main_~f1~0_9 1) (= v_ULTIMATE.start_main_~result~0_3 1) (>= 46340 v_ULTIMATE.start_main_~f1~0_9)) InVars {ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_9, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 5886#L89 [177] L89-->L89-1: Formula: |v_ULTIMATE.start_main_#t~short13_1| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|} AuxVars[] AssignedVars[] 5855#L89-1 [176] L89-1-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_3| v_ULTIMATE.start_main_~f1~0_10) (= |v_mult_#in~mInParam_3| v_ULTIMATE.start_main_~f2~0_6)) InVars {ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_6, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_3|, mult_#in~n=|v_mult_#in~nInParam_3|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 5904#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 5853#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 5856#L19 107.32/64.49 [2019-03-28 12:24:11,449 INFO L796 eck$LassoCheckResult]: Loop: 5856#L19 [230] L19-->L22: Formula: (< 0 v_mult_~m_2) InVars {mult_~m=v_mult_~m_2} OutVars{mult_~m=v_mult_~m_2} AuxVars[] AssignedVars[] 5902#L22 [235] L22-->L25: Formula: (< 1 v_mult_~m_4) InVars {mult_~m=v_mult_~m_4} OutVars{mult_~m=v_mult_~m_4} AuxVars[] AssignedVars[] 5870#L25 [163] L25-->multENTRY: Formula: (and (= |v_mult_#in~mInParam_2| (+ v_mult_~m_11 (- 1))) (= |v_mult_#in~nInParam_2| v_mult_~n_6)) InVars {mult_~n=v_mult_~n_6, mult_~m=v_mult_~m_11} OutVars{mult_#in~m=|v_mult_#in~mInParam_2|, mult_#in~n=|v_mult_#in~nInParam_2|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 5872#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 5914#L16 [125] L16-->L17: Formula: (< v_mult_~m_7 0) InVars {mult_~m=v_mult_~m_7} OutVars{mult_~m=v_mult_~m_7} AuxVars[] AssignedVars[] 5871#L17 [179] L17-->multENTRY: Formula: (and (= |v_mult_#in~nInParam_1| v_mult_~n_5) (= |v_mult_#in~mInParam_1| (- v_mult_~m_10))) InVars {mult_~n=v_mult_~n_5, mult_~m=v_mult_~m_10} OutVars{mult_#in~m=|v_mult_#in~mInParam_1|, mult_#in~n=|v_mult_#in~nInParam_1|} AuxVars[] AssignedVars[mult_#in~m, mult_#in~n]< 5908#multENTRY [180] multENTRY-->L16: Formula: (and (= v_mult_~n_2 |v_mult_#in~n_1|) (= v_mult_~m_6 |v_mult_#in~m_1|)) InVars {mult_#in~m=|v_mult_#in~m_1|, mult_#in~n=|v_mult_#in~n_1|} OutVars{mult_#in~m=|v_mult_#in~m_1|, mult_~n=v_mult_~n_2, mult_~m=v_mult_~m_6, mult_#in~n=|v_mult_#in~n_1|} AuxVars[] AssignedVars[mult_~n, mult_~m] 5913#L16 [207] L16-->L19: Formula: (>= v_mult_~m_9 0) InVars {mult_~m=v_mult_~m_9} OutVars{mult_~m=v_mult_~m_9} AuxVars[] AssignedVars[] 5856#L19 107.32/64.49 [2019-03-28 12:24:11,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:11,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1131124979, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:11,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:11,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1741348632, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:11,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:11,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:11,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:11,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 107.32/64.49 [2019-03-28 12:24:11,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 107.32/64.49 [2019-03-28 12:24:11,484 INFO L811 eck$LassoCheckResult]: loop already infeasible 107.32/64.49 [2019-03-28 12:24:11,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 107.32/64.49 [2019-03-28 12:24:11,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 107.32/64.49 [2019-03-28 12:24:11,485 INFO L87 Difference]: Start difference. First operand 211 states and 295 transitions. cyclomatic complexity: 89 Second operand 5 states. 107.32/64.49 [2019-03-28 12:24:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.32/64.49 [2019-03-28 12:24:11,555 INFO L93 Difference]: Finished difference Result 210 states and 292 transitions. 107.32/64.49 [2019-03-28 12:24:11,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 107.32/64.49 [2019-03-28 12:24:11,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. 107.32/64.49 [2019-03-28 12:24:11,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 107.32/64.49 [2019-03-28 12:24:11,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 157 states and 208 transitions. 107.32/64.49 [2019-03-28 12:24:11,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 107.32/64.49 [2019-03-28 12:24:11,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 107.32/64.49 [2019-03-28 12:24:11,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 208 transitions. 107.32/64.49 [2019-03-28 12:24:11,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.32/64.49 [2019-03-28 12:24:11,563 INFO L706 BuchiCegarLoop]: Abstraction has 157 states and 208 transitions. 107.32/64.49 [2019-03-28 12:24:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states and 208 transitions. 107.32/64.49 [2019-03-28 12:24:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 117. 107.32/64.49 [2019-03-28 12:24:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. 107.32/64.49 [2019-03-28 12:24:11,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. 107.32/64.49 [2019-03-28 12:24:11,568 INFO L729 BuchiCegarLoop]: Abstraction has 117 states and 159 transitions. 107.32/64.49 [2019-03-28 12:24:11,568 INFO L609 BuchiCegarLoop]: Abstraction has 117 states and 159 transitions. 107.32/64.49 [2019-03-28 12:24:11,568 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ 107.32/64.49 [2019-03-28 12:24:11,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 159 transitions. 107.32/64.49 [2019-03-28 12:24:11,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 107.32/64.49 [2019-03-28 12:24:11,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.32/64.49 [2019-03-28 12:24:11,569 INFO L119 BuchiIsEmpty]: Starting construction of run 107.32/64.49 [2019-03-28 12:24:11,569 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:11,569 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] 107.32/64.49 [2019-03-28 12:24:11,570 INFO L794 eck$LassoCheckResult]: Stem: 6313#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 6290#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 6305#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 6307#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 6296#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 6297#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 6308#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 6301#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 6323#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 6325#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 6395#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 6300#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 6302#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 6291#L42 107.32/64.49 [2019-03-28 12:24:11,570 INFO L796 eck$LassoCheckResult]: Loop: 6291#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 6326#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 6329#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 6328#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 6281#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 6394#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 6291#L42 107.32/64.49 [2019-03-28 12:24:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1467599285, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:11,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:11,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:11,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 806318160, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:11,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:11,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1060119300, now seen corresponding path program 1 times 107.32/64.49 [2019-03-28 12:24:11,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.32/64.49 [2019-03-28 12:24:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.32/64.49 [2019-03-28 12:24:11,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.32/64.49 [2019-03-28 12:24:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.32/64.49 [2019-03-28 12:24:11,685 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:11,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:11,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:11,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:11,685 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.32/64.49 [2019-03-28 12:24:11,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:11,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:11,686 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:11,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop 107.32/64.49 [2019-03-28 12:24:11,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:11,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:11,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:11,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:11,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:11,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:11,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:11,765 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:11,765 INFO L412 LassoAnalysis]: Checking for nontermination... 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:11,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:11,773 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:11,777 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.32/64.49 [2019-03-28 12:24:11,777 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:11,806 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:11,806 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.32/64.49 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.32/64.49 Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:11,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.32/64.49 [2019-03-28 12:24:11,843 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.32/64.49 [2019-03-28 12:24:18,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. 107.32/64.49 [2019-03-28 12:24:18,798 INFO L216 LassoAnalysis]: Preferences: 107.32/64.49 [2019-03-28 12:24:18,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.32/64.49 [2019-03-28 12:24:18,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.32/64.49 [2019-03-28 12:24:18,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.32/64.49 [2019-03-28 12:24:18,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.32/64.49 [2019-03-28 12:24:18,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.32/64.49 [2019-03-28 12:24:18,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.32/64.49 [2019-03-28 12:24:18,799 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.32/64.49 [2019-03-28 12:24:18,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration12_Loop 107.32/64.49 [2019-03-28 12:24:18,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.32/64.49 [2019-03-28 12:24:18,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.32/64.49 [2019-03-28 12:24:18,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:18,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:18,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:18,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:18,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.32/64.49 [2019-03-28 12:24:18,856 INFO L300 LassoAnalysis]: Preprocessing complete. 107.32/64.49 [2019-03-28 12:24:18,856 INFO L497 LassoAnalysis]: Using template 'affine'. 107.32/64.49 [2019-03-28 12:24:18,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:18,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:18,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:18,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:18,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:18,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:18,858 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:18,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:18,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.32/64.49 [2019-03-28 12:24:18,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.32/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.32/64.49 Number of strict supporting invariants: 0 107.32/64.49 Number of non-strict supporting invariants: 1 107.32/64.49 Consider only non-deceasing supporting invariants: true 107.32/64.49 Simplify termination arguments: true 107.32/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.32/64.49 [2019-03-28 12:24:18,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.32/64.49 [2019-03-28 12:24:18,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.32/64.49 [2019-03-28 12:24:18,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.32/64.49 [2019-03-28 12:24:18,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.32/64.49 [2019-03-28 12:24:18,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.32/64.49 [2019-03-28 12:24:18,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.32/64.49 [2019-03-28 12:24:18,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.32/64.49 [2019-03-28 12:24:18,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.32/64.49 [2019-03-28 12:24:18,870 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 107.32/64.49 [2019-03-28 12:24:18,870 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. 107.32/64.49 [2019-03-28 12:24:18,870 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.32/64.49 [2019-03-28 12:24:18,871 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.32/64.49 [2019-03-28 12:24:18,871 INFO L518 LassoAnalysis]: Proved termination. 107.32/64.49 [2019-03-28 12:24:18,871 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.32/64.49 Ranking function f(multiple_of_~n) = 1*multiple_of_~n 107.32/64.49 Supporting invariants [] 107.32/64.49 [2019-03-28 12:24:18,871 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.32/64.49 [2019-03-28 12:24:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.32/64.49 [2019-03-28 12:24:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:18,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:18,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:18,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:18,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.32/64.49 [2019-03-28 12:24:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:18,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:18,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.32/64.49 [2019-03-28 12:24:19,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core 107.32/64.49 [2019-03-28 12:24:19,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.32/64.49 [2019-03-28 12:24:19,180 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 11 predicates after loop cannibalization 107.32/64.49 [2019-03-28 12:24:19,180 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 11 loop predicates 107.32/64.49 [2019-03-28 12:24:19,181 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 117 states and 159 transitions. cyclomatic complexity: 45 Second operand 7 states. 107.32/64.49 [2019-03-28 12:24:20,185 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 117 states and 159 transitions. cyclomatic complexity: 45. Second operand 7 states. Result 4221 states and 5750 transitions. Complement of second has 1198 states. 107.39/64.49 [2019-03-28 12:24:20,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 1 stem states 15 non-accepting loop states 4 accepting loop states 107.39/64.49 [2019-03-28 12:24:20,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. 107.39/64.49 [2019-03-28 12:24:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 117 transitions. 107.39/64.49 [2019-03-28 12:24:20,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 117 transitions. Stem has 13 letters. Loop has 6 letters. 107.39/64.49 [2019-03-28 12:24:20,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.39/64.49 [2019-03-28 12:24:20,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 117 transitions. Stem has 19 letters. Loop has 6 letters. 107.39/64.49 [2019-03-28 12:24:20,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.39/64.49 [2019-03-28 12:24:20,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 117 transitions. Stem has 13 letters. Loop has 12 letters. 107.39/64.49 [2019-03-28 12:24:20,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.39/64.49 [2019-03-28 12:24:20,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4221 states and 5750 transitions. 107.39/64.49 [2019-03-28 12:24:20,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 39 107.39/64.49 [2019-03-28 12:24:20,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4221 states to 340 states and 489 transitions. 107.39/64.49 [2019-03-28 12:24:20,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 107.39/64.49 [2019-03-28 12:24:20,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 107.39/64.49 [2019-03-28 12:24:20,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 489 transitions. 107.39/64.49 [2019-03-28 12:24:20,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.39/64.49 [2019-03-28 12:24:20,241 INFO L706 BuchiCegarLoop]: Abstraction has 340 states and 489 transitions. 107.39/64.49 [2019-03-28 12:24:20,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 489 transitions. 107.39/64.49 [2019-03-28 12:24:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 210. 107.39/64.49 [2019-03-28 12:24:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. 107.39/64.49 [2019-03-28 12:24:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,251 INFO L729 BuchiCegarLoop]: Abstraction has 210 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,251 INFO L609 BuchiCegarLoop]: Abstraction has 210 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,252 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ 107.39/64.49 [2019-03-28 12:24:20,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 210 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 107.39/64.49 [2019-03-28 12:24:20,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.39/64.49 [2019-03-28 12:24:20,253 INFO L119 BuchiIsEmpty]: Starting construction of run 107.39/64.49 [2019-03-28 12:24:20,254 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.39/64.49 [2019-03-28 12:24:20,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] 107.39/64.49 [2019-03-28 12:24:20,254 INFO L794 eck$LassoCheckResult]: Stem: 12025#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 11986#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12013#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 12015#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 12002#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 12003#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 12018#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 12022#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12032#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12067#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12062#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12063#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12021#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12023#L42 107.39/64.49 [2019-03-28 12:24:20,255 INFO L796 eck$LassoCheckResult]: Loop: 12023#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12039#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12133#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12134#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 12007#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12000#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12036#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12066#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12006#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12010#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12023#L42 107.39/64.49 [2019-03-28 12:24:20,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:20,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1467599285, now seen corresponding path program 2 times 107.39/64.49 [2019-03-28 12:24:20,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:24:20,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:24:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2037635822, now seen corresponding path program 1 times 107.39/64.49 [2019-03-28 12:24:20,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:24:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:24:20,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash -824962142, now seen corresponding path program 1 times 107.39/64.49 [2019-03-28 12:24:20,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:24:20,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:24:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.39/64.49 [2019-03-28 12:24:20,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 107.39/64.49 [2019-03-28 12:24:20,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 107.39/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.39/64.49 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 107.39/64.49 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 107.39/64.49 [2019-03-28 12:24:20,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:20,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:20,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.39/64.49 [2019-03-28 12:24:20,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 107.39/64.49 [2019-03-28 12:24:20,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 107.39/64.49 [2019-03-28 12:24:20,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 107.39/64.49 [2019-03-28 12:24:20,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 107.39/64.49 [2019-03-28 12:24:20,523 INFO L87 Difference]: Start difference. First operand 210 states and 284 transitions. cyclomatic complexity: 79 Second operand 8 states. 107.39/64.49 [2019-03-28 12:24:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.39/64.49 [2019-03-28 12:24:20,650 INFO L93 Difference]: Finished difference Result 247 states and 335 transitions. 107.39/64.49 [2019-03-28 12:24:20,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 107.39/64.49 [2019-03-28 12:24:20,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 335 transitions. 107.39/64.49 [2019-03-28 12:24:20,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 107.39/64.49 [2019-03-28 12:24:20,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 247 states and 335 transitions. 107.39/64.49 [2019-03-28 12:24:20,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 107.39/64.49 [2019-03-28 12:24:20,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 107.39/64.49 [2019-03-28 12:24:20,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 335 transitions. 107.39/64.49 [2019-03-28 12:24:20,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.39/64.49 [2019-03-28 12:24:20,659 INFO L706 BuchiCegarLoop]: Abstraction has 247 states and 335 transitions. 107.39/64.49 [2019-03-28 12:24:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 335 transitions. 107.39/64.49 [2019-03-28 12:24:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 221. 107.39/64.49 [2019-03-28 12:24:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. 107.39/64.49 [2019-03-28 12:24:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,666 INFO L729 BuchiCegarLoop]: Abstraction has 221 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,666 INFO L609 BuchiCegarLoop]: Abstraction has 221 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,666 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ 107.39/64.49 [2019-03-28 12:24:20,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 221 states and 284 transitions. 107.39/64.49 [2019-03-28 12:24:20,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 107.39/64.49 [2019-03-28 12:24:20,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.39/64.49 [2019-03-28 12:24:20,670 INFO L119 BuchiIsEmpty]: Starting construction of run 107.39/64.49 [2019-03-28 12:24:20,670 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] 107.39/64.49 [2019-03-28 12:24:20,670 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1] 107.39/64.49 [2019-03-28 12:24:20,671 INFO L794 eck$LassoCheckResult]: Stem: 12567#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 12538#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 12556#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 12558#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 12547#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 12548#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 12561#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 12552#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12574#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12577#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12644#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12551#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12553#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12564#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12579#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12707#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12623#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12630#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12627#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12522#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12625#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12622#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12521#L33 107.39/64.49 [2019-03-28 12:24:20,671 INFO L796 eck$LassoCheckResult]: Loop: 12521#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 12523#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12540#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12569#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12570#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12608#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12643#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12543#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12681#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12679#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12676#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 12630#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 12627#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 12522#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 12625#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 12622#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 12521#L33 107.39/64.49 [2019-03-28 12:24:20,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1119680250, now seen corresponding path program 2 times 107.39/64.49 [2019-03-28 12:24:20,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:24:20,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:24:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1838862597, now seen corresponding path program 2 times 107.39/64.49 [2019-03-28 12:24:20,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:24:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:24:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1759819262, now seen corresponding path program 2 times 107.39/64.49 [2019-03-28 12:24:20,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:24:20,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:24:20,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:24:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. 107.39/64.49 [2019-03-28 12:24:20,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 107.39/64.49 [2019-03-28 12:24:20,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 107.39/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.39/64.49 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 107.39/64.49 Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 107.39/64.49 [2019-03-28 12:24:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 107.39/64.49 [2019-03-28 12:24:20,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 107.39/64.49 [2019-03-28 12:24:20,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:20,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:20,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 39 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. 107.39/64.49 [2019-03-28 12:24:20,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 107.39/64.49 [2019-03-28 12:24:20,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 107.39/64.49 [2019-03-28 12:24:21,121 INFO L216 LassoAnalysis]: Preferences: 107.39/64.49 [2019-03-28 12:24:21,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.39/64.49 [2019-03-28 12:24:21,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.39/64.49 [2019-03-28 12:24:21,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.39/64.49 [2019-03-28 12:24:21,122 INFO L127 ssoRankerPreferences]: Use exernal solver: true 107.39/64.49 [2019-03-28 12:24:21,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.39/64.49 [2019-03-28 12:24:21,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.39/64.49 [2019-03-28 12:24:21,122 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.39/64.49 [2019-03-28 12:24:21,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop 107.39/64.49 [2019-03-28 12:24:21,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.39/64.49 [2019-03-28 12:24:21,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.39/64.49 [2019-03-28 12:24:21,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:21,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:21,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:21,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:21,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:21,178 INFO L300 LassoAnalysis]: Preprocessing complete. 107.39/64.49 [2019-03-28 12:24:21,178 INFO L412 LassoAnalysis]: Checking for nontermination... 107.39/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.39/64.49 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.39/64.49 Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.39/64.49 [2019-03-28 12:24:21,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.39/64.49 [2019-03-28 12:24:21,181 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.39/64.49 [2019-03-28 12:24:21,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. 107.39/64.49 [2019-03-28 12:24:21,184 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 107.39/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.39/64.49 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.39/64.49 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.39/64.49 [2019-03-28 12:24:21,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true 107.39/64.49 [2019-03-28 12:24:21,210 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.39/64.49 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 107.39/64.49 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 107.39/64.49 Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 107.39/64.49 [2019-03-28 12:24:21,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true 107.39/64.49 [2019-03-28 12:24:21,245 INFO L163 nArgumentSynthesizer]: Using integer mode. 107.39/64.49 [2019-03-28 12:24:33,286 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. 107.39/64.49 [2019-03-28 12:24:33,290 INFO L216 LassoAnalysis]: Preferences: 107.39/64.49 [2019-03-28 12:24:33,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 107.39/64.49 [2019-03-28 12:24:33,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 107.39/64.49 [2019-03-28 12:24:33,291 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 107.39/64.49 [2019-03-28 12:24:33,291 INFO L127 ssoRankerPreferences]: Use exernal solver: false 107.39/64.49 [2019-03-28 12:24:33,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 107.39/64.49 [2019-03-28 12:24:33,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 107.39/64.49 [2019-03-28 12:24:33,291 INFO L130 ssoRankerPreferences]: Path of dumped script: 107.39/64.49 [2019-03-28 12:24:33,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration14_Loop 107.39/64.49 [2019-03-28 12:24:33,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 107.39/64.49 [2019-03-28 12:24:33,291 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 107.39/64.49 [2019-03-28 12:24:33,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:33,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:33,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:33,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:33,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 107.39/64.49 [2019-03-28 12:24:33,350 INFO L300 LassoAnalysis]: Preprocessing complete. 107.39/64.49 [2019-03-28 12:24:33,350 INFO L497 LassoAnalysis]: Using template 'affine'. 107.39/64.49 [2019-03-28 12:24:33,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.39/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.39/64.49 Number of strict supporting invariants: 0 107.39/64.49 Number of non-strict supporting invariants: 1 107.39/64.49 Consider only non-deceasing supporting invariants: true 107.39/64.49 Simplify termination arguments: true 107.39/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.39/64.49 [2019-03-28 12:24:33,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.39/64.49 [2019-03-28 12:24:33,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.39/64.49 [2019-03-28 12:24:33,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.39/64.49 [2019-03-28 12:24:33,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.39/64.49 [2019-03-28 12:24:33,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.39/64.49 [2019-03-28 12:24:33,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.39/64.49 [2019-03-28 12:24:33,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.39/64.49 [2019-03-28 12:24:33,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.39/64.49 [2019-03-28 12:24:33,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.39/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.39/64.49 Number of strict supporting invariants: 0 107.39/64.49 Number of non-strict supporting invariants: 1 107.39/64.49 Consider only non-deceasing supporting invariants: true 107.39/64.49 Simplify termination arguments: true 107.39/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.39/64.49 [2019-03-28 12:24:33,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.39/64.49 [2019-03-28 12:24:33,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.39/64.49 [2019-03-28 12:24:33,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.39/64.49 [2019-03-28 12:24:33,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.39/64.49 [2019-03-28 12:24:33,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.39/64.49 [2019-03-28 12:24:33,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.39/64.49 [2019-03-28 12:24:33,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.39/64.49 [2019-03-28 12:24:33,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.39/64.49 [2019-03-28 12:24:33,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.39/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.39/64.49 Number of strict supporting invariants: 0 107.39/64.49 Number of non-strict supporting invariants: 1 107.39/64.49 Consider only non-deceasing supporting invariants: true 107.39/64.49 Simplify termination arguments: true 107.39/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.39/64.49 [2019-03-28 12:24:33,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.39/64.49 [2019-03-28 12:24:33,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.39/64.49 [2019-03-28 12:24:33,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.39/64.49 [2019-03-28 12:24:33,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.39/64.49 [2019-03-28 12:24:33,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.39/64.49 [2019-03-28 12:24:33,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.39/64.49 [2019-03-28 12:24:33,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.39/64.49 [2019-03-28 12:24:33,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.39/64.49 [2019-03-28 12:24:33,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.39/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.39/64.49 Number of strict supporting invariants: 0 107.39/64.49 Number of non-strict supporting invariants: 1 107.39/64.49 Consider only non-deceasing supporting invariants: true 107.39/64.49 Simplify termination arguments: true 107.39/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.39/64.49 [2019-03-28 12:24:33,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.39/64.49 [2019-03-28 12:24:33,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.39/64.49 [2019-03-28 12:24:33,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.39/64.49 [2019-03-28 12:24:33,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.39/64.49 [2019-03-28 12:24:33,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.39/64.49 [2019-03-28 12:24:33,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.39/64.49 [2019-03-28 12:24:33,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.39/64.49 [2019-03-28 12:24:33,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 107.39/64.49 [2019-03-28 12:24:33,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 107.39/64.49 Termination analysis: LINEAR_WITH_GUESSES 107.39/64.49 Number of strict supporting invariants: 0 107.39/64.49 Number of non-strict supporting invariants: 1 107.39/64.49 Consider only non-deceasing supporting invariants: true 107.39/64.49 Simplify termination arguments: true 107.39/64.49 Simplify supporting invariants: trueOverapproximate stem: false 107.39/64.49 [2019-03-28 12:24:33,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. 107.39/64.49 [2019-03-28 12:24:33,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 107.39/64.49 [2019-03-28 12:24:33,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 107.39/64.49 [2019-03-28 12:24:33,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 107.39/64.49 [2019-03-28 12:24:33,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 107.39/64.49 [2019-03-28 12:24:33,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 107.39/64.49 [2019-03-28 12:24:33,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 107.39/64.49 [2019-03-28 12:24:33,364 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 107.39/64.49 [2019-03-28 12:24:33,367 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. 107.39/64.49 [2019-03-28 12:24:33,367 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. 107.39/64.49 [2019-03-28 12:24:33,367 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 107.39/64.49 [2019-03-28 12:24:33,367 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. 107.39/64.49 [2019-03-28 12:24:33,368 INFO L518 LassoAnalysis]: Proved termination. 107.39/64.49 [2019-03-28 12:24:33,368 INFO L520 LassoAnalysis]: Termination argument consisting of: 107.39/64.49 Ranking function f(multiple_of_~n) = -1*multiple_of_~n 107.39/64.49 Supporting invariants [] 107.39/64.49 [2019-03-28 12:24:33,368 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed 107.39/64.49 [2019-03-28 12:24:33,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:24:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:33,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:33,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:33,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:33,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 107.39/64.49 [2019-03-28 12:24:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:33,671 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:33,688 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:33,705 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:33,722 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:33,739 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:33,756 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:33,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:33,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:33,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:24:34,072 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 107.39/64.49 [2019-03-28 12:24:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 107.39/64.49 [2019-03-28 12:24:34,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core 107.39/64.49 [2019-03-28 12:24:34,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... 107.39/64.49 [2019-03-28 12:24:34,113 INFO L98 LoopCannibalizer]: 10 predicates before loop cannibalization 21 predicates after loop cannibalization 107.39/64.49 [2019-03-28 12:24:34,113 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 21 loop predicates 107.39/64.49 [2019-03-28 12:24:34,114 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 221 states and 284 transitions. cyclomatic complexity: 68 Second operand 12 states. 107.39/64.49 [2019-03-28 12:24:58,580 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 221 states and 284 transitions. cyclomatic complexity: 68. Second operand 12 states. Result 210542 states and 264874 transitions. Complement of second has 72429 states. 107.39/64.49 [2019-03-28 12:24:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 72 states 1 stem states 67 non-accepting loop states 3 accepting loop states 107.39/64.49 [2019-03-28 12:24:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. 107.39/64.49 [2019-03-28 12:24:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 311 transitions. 107.39/64.49 [2019-03-28 12:24:58,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 311 transitions. Stem has 22 letters. Loop has 16 letters. 107.39/64.49 [2019-03-28 12:24:58,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.39/64.49 [2019-03-28 12:24:58,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 311 transitions. Stem has 38 letters. Loop has 16 letters. 107.39/64.49 [2019-03-28 12:24:58,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.39/64.49 [2019-03-28 12:24:58,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 311 transitions. Stem has 22 letters. Loop has 32 letters. 107.39/64.49 [2019-03-28 12:24:58,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. 107.39/64.49 [2019-03-28 12:24:58,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210542 states and 264874 transitions. 107.39/64.49 [2019-03-28 12:25:00,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 107.39/64.49 [2019-03-28 12:25:00,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210542 states to 578 states and 692 transitions. 107.39/64.49 [2019-03-28 12:25:00,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 107.39/64.49 [2019-03-28 12:25:00,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 107.39/64.49 [2019-03-28 12:25:00,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 692 transitions. 107.39/64.49 [2019-03-28 12:25:00,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.39/64.49 [2019-03-28 12:25:00,325 INFO L706 BuchiCegarLoop]: Abstraction has 578 states and 692 transitions. 107.39/64.49 [2019-03-28 12:25:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 692 transitions. 107.39/64.49 [2019-03-28 12:25:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 299. 107.39/64.49 [2019-03-28 12:25:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. 107.39/64.49 [2019-03-28 12:25:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 347 transitions. 107.39/64.49 [2019-03-28 12:25:00,338 INFO L729 BuchiCegarLoop]: Abstraction has 299 states and 347 transitions. 107.39/64.49 [2019-03-28 12:25:00,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 107.39/64.49 [2019-03-28 12:25:00,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 107.39/64.49 [2019-03-28 12:25:00,338 INFO L87 Difference]: Start difference. First operand 299 states and 347 transitions. Second operand 16 states. 107.39/64.49 [2019-03-28 12:25:00,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 107.39/64.49 [2019-03-28 12:25:00,812 INFO L93 Difference]: Finished difference Result 344 states and 410 transitions. 107.39/64.49 [2019-03-28 12:25:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 107.39/64.49 [2019-03-28 12:25:00,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 344 states and 410 transitions. 107.39/64.49 [2019-03-28 12:25:00,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 107.39/64.49 [2019-03-28 12:25:00,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 344 states to 344 states and 410 transitions. 107.39/64.49 [2019-03-28 12:25:00,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 107.39/64.49 [2019-03-28 12:25:00,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 107.39/64.49 [2019-03-28 12:25:00,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 344 states and 410 transitions. 107.39/64.49 [2019-03-28 12:25:00,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. 107.39/64.49 [2019-03-28 12:25:00,822 INFO L706 BuchiCegarLoop]: Abstraction has 344 states and 410 transitions. 107.39/64.49 [2019-03-28 12:25:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states and 410 transitions. 107.39/64.49 [2019-03-28 12:25:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 299. 107.39/64.49 [2019-03-28 12:25:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. 107.39/64.49 [2019-03-28 12:25:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 347 transitions. 107.39/64.49 [2019-03-28 12:25:00,830 INFO L729 BuchiCegarLoop]: Abstraction has 299 states and 347 transitions. 107.39/64.49 [2019-03-28 12:25:00,831 INFO L609 BuchiCegarLoop]: Abstraction has 299 states and 347 transitions. 107.39/64.49 [2019-03-28 12:25:00,831 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ 107.39/64.49 [2019-03-28 12:25:00,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 347 transitions. 107.39/64.49 [2019-03-28 12:25:00,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 107.39/64.49 [2019-03-28 12:25:00,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 107.39/64.49 [2019-03-28 12:25:00,832 INFO L119 BuchiIsEmpty]: Starting construction of run 107.39/64.49 [2019-03-28 12:25:00,832 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 107.39/64.49 [2019-03-28 12:25:00,832 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] 107.39/64.49 [2019-03-28 12:25:00,833 INFO L794 eck$LassoCheckResult]: Stem: 296980#ULTIMATE.startENTRY [241] ULTIMATE.startENTRY-->L51: Formula: (and (= v_ULTIMATE.start_main_~n~0_7 |v_ULTIMATE.start_is_prime_#in~n_2|) (<= 1 v_ULTIMATE.start_main_~n~0_7) (<= v_ULTIMATE.start_main_~n~0_7 46340) (= v_ULTIMATE.start_is_prime_~n_5 |v_ULTIMATE.start_is_prime_#in~n_2|)) InVars {} OutVars{ULTIMATE.start_is_prime_#in~n=|v_ULTIMATE.start_is_prime_#in~n_2|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_6|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_5, ULTIMATE.start_is_prime_#res=|v_ULTIMATE.start_is_prime_#res_5|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_~result~0=v_ULTIMATE.start_main_~result~0_5, ULTIMATE.start_main_~f1~0=v_ULTIMATE.start_main_~f1~0_12, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_8|, ULTIMATE.start_main_#t~ret9=|v_ULTIMATE.start_main_#t~ret9_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_10|, ULTIMATE.start_main_~f2~0=v_ULTIMATE.start_main_~f2~0_7, ULTIMATE.start_is_prime_#t~ret5=|v_ULTIMATE.start_is_prime_#t~ret5_8|} AuxVars[] AssignedVars[ULTIMATE.start_is_prime_#in~n, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_is_prime_~n, ULTIMATE.start_is_prime_#res, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_~result~0, ULTIMATE.start_main_~f1~0, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~ret9, ULTIMATE.start_main_#t~short13, ULTIMATE.start_main_~f2~0, ULTIMATE.start_is_prime_#t~ret5] 296957#L51 [130] L51-->is_prime_ENTRY: Formula: (and (= |v_is_prime__#in~mInParam_1| (+ v_ULTIMATE.start_is_prime_~n_4 (- 1))) (= |v_is_prime__#in~nInParam_1| v_ULTIMATE.start_is_prime_~n_4)) InVars {ULTIMATE.start_is_prime_~n=v_ULTIMATE.start_is_prime_~n_4} OutVars{is_prime__#in~m=|v_is_prime__#in~mInParam_1|, is_prime__#in~n=|v_is_prime__#in~nInParam_1|} AuxVars[] AssignedVars[is_prime__#in~m, is_prime__#in~n]< 296972#is_prime_ENTRY [131] is_prime_ENTRY-->L56: Formula: (and (= v_is_prime__~n_4 |v_is_prime__#in~n_1|) (= v_is_prime__~m_4 |v_is_prime__#in~m_1|)) InVars {is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} OutVars{is_prime__~n=v_is_prime__~n_4, is_prime__~m=v_is_prime__~m_4, is_prime__#in~m=|v_is_prime__#in~m_1|, is_prime__#in~n=|v_is_prime__#in~n_1|} AuxVars[] AssignedVars[is_prime__~n, is_prime__~m] 296976#L56 [196] L56-->L59: Formula: (> v_is_prime__~n_6 1) InVars {is_prime__~n=v_is_prime__~n_6} OutVars{is_prime__~n=v_is_prime__~n_6} AuxVars[] AssignedVars[] 296965#L59 [215] L59-->L62: Formula: (< 2 v_is_prime__~n_8) InVars {is_prime__~n=v_is_prime__~n_8} OutVars{is_prime__~n=v_is_prime__~n_8} AuxVars[] AssignedVars[] 296966#L62 [148] L62-->L63: Formula: (< 2 v_is_prime__~n_9) InVars {is_prime__~n=v_is_prime__~n_9} OutVars{is_prime__~n=v_is_prime__~n_9} AuxVars[] AssignedVars[] 296973#L63 [199] L63-->L66: Formula: (> v_is_prime__~m_1 1) InVars {is_prime__~m=v_is_prime__~m_1} OutVars{is_prime__~m=v_is_prime__~m_1} AuxVars[] AssignedVars[] 296981#L66 [158] L66-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~mInParam_4| v_is_prime__~m_6) (= |v_multiple_of_#in~nInParam_4| v_is_prime__~n_10)) InVars {is_prime__~n=v_is_prime__~n_10, is_prime__~m=v_is_prime__~m_6} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_4|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_4|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 296995#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 296998#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 297013#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 297014#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 296984#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 296985#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297024#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 297023#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 297019#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 297022#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 297021#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 296946#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297020#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 297018#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 296945#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 296947#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297025#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 296991#L30 107.39/64.49 [2019-03-28 12:25:00,833 INFO L796 eck$LassoCheckResult]: Loop: 296991#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 296992#L33 [203] L33-->L36: Formula: (>= v_multiple_of_~n_5 0) InVars {multiple_of_~n=v_multiple_of_~n_5} OutVars{multiple_of_~n=v_multiple_of_~n_5} AuxVars[] AssignedVars[] 296969#L36 [226] L36-->L39: Formula: (< 0 v_multiple_of_~m_7) InVars {multiple_of_~m=v_multiple_of_~m_7} OutVars{multiple_of_~m=v_multiple_of_~m_7} AuxVars[] AssignedVars[] 296970#L39 [228] L39-->L42: Formula: (< 0 v_multiple_of_~n_7) InVars {multiple_of_~n=v_multiple_of_~n_7} OutVars{multiple_of_~n=v_multiple_of_~n_7} AuxVars[] AssignedVars[] 297001#L42 [141] L42-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_3| (+ v_multiple_of_~n_11 (* (- 1) v_multiple_of_~m_11))) (= |v_multiple_of_#in~mInParam_3| v_multiple_of_~m_11)) InVars {multiple_of_~m=v_multiple_of_~m_11, multiple_of_~n=v_multiple_of_~n_11} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_3|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_3|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297002#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 297026#L30 [202] L30-->L33: Formula: (>= v_multiple_of_~m_4 0) InVars {multiple_of_~m=v_multiple_of_~m_4} OutVars{multiple_of_~m=v_multiple_of_~m_4} AuxVars[] AssignedVars[] 297053#L33 [142] L33-->L34: Formula: (< v_multiple_of_~n_3 0) InVars {multiple_of_~n=v_multiple_of_~n_3} OutVars{multiple_of_~n=v_multiple_of_~n_3} AuxVars[] AssignedVars[] 296947#L34 [127] L34-->multiple_ofENTRY: Formula: (and (= |v_multiple_of_#in~nInParam_2| (- v_multiple_of_~n_10)) (= |v_multiple_of_#in~mInParam_2| v_multiple_of_~m_10)) InVars {multiple_of_~m=v_multiple_of_~m_10, multiple_of_~n=v_multiple_of_~n_10} OutVars{multiple_of_#in~m=|v_multiple_of_#in~mInParam_2|, multiple_of_#in~n=|v_multiple_of_#in~nInParam_2|} AuxVars[] AssignedVars[multiple_of_#in~m, multiple_of_#in~n]< 297025#multiple_ofENTRY [185] multiple_ofENTRY-->L30: Formula: (and (= v_multiple_of_~m_1 |v_multiple_of_#in~m_1|) (= v_multiple_of_~n_1 |v_multiple_of_#in~n_1|)) InVars {multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_#in~n=|v_multiple_of_#in~n_1|} OutVars{multiple_of_#in~m=|v_multiple_of_#in~m_1|, multiple_of_~n=v_multiple_of_~n_1, multiple_of_~m=v_multiple_of_~m_1, multiple_of_#in~n=|v_multiple_of_#in~n_1|} AuxVars[] AssignedVars[multiple_of_~n, multiple_of_~m] 296991#L30 107.39/64.49 [2019-03-28 12:25:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:25:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1678447598, now seen corresponding path program 3 times 107.39/64.49 [2019-03-28 12:25:00,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:25:00,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:25:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:25:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:25:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:25:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1239768658, now seen corresponding path program 3 times 107.39/64.49 [2019-03-28 12:25:00,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:25:00,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:25:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:25:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:25:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 107.39/64.49 [2019-03-28 12:25:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1721536165, now seen corresponding path program 4 times 107.39/64.49 [2019-03-28 12:25:00,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 107.39/64.49 [2019-03-28 12:25:00,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 107.39/64.49 [2019-03-28 12:25:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 107.39/64.49 [2019-03-28 12:25:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:25:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 107.39/64.49 [2019-03-28 12:25:01,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:25:01 BasicIcfg 107.39/64.49 [2019-03-28 12:25:01,433 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 107.39/64.49 [2019-03-28 12:25:01,433 INFO L168 Benchmark]: Toolchain (without parser) took 60158.47 ms. Allocated memory was 649.6 MB in the beginning and 5.3 GB in the end (delta: 4.6 GB). Free memory was 563.8 MB in the beginning and 3.3 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,435 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.19 ms. Allocated memory was 649.6 MB in the beginning and 666.9 MB in the end (delta: 17.3 MB). Free memory was 563.8 MB in the beginning and 630.8 MB in the end (delta: -67.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 666.9 MB. Free memory was 630.8 MB in the beginning and 628.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,436 INFO L168 Benchmark]: Boogie Preprocessor took 23.47 ms. Allocated memory is still 666.9 MB. Free memory was 628.7 MB in the beginning and 627.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,437 INFO L168 Benchmark]: RCFGBuilder took 345.60 ms. Allocated memory is still 666.9 MB. Free memory was 627.6 MB in the beginning and 605.5 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,437 INFO L168 Benchmark]: BlockEncodingV2 took 118.78 ms. Allocated memory is still 666.9 MB. Free memory was 605.5 MB in the beginning and 596.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,438 INFO L168 Benchmark]: TraceAbstraction took 211.96 ms. Allocated memory is still 666.9 MB. Free memory was 596.8 MB in the beginning and 580.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,438 INFO L168 Benchmark]: BuchiAutomizer took 59096.73 ms. Allocated memory was 666.9 MB in the beginning and 5.3 GB in the end (delta: 4.6 GB). Free memory was 580.6 MB in the beginning and 3.3 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 50.3 GB. 107.39/64.49 [2019-03-28 12:25:01,441 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 107.39/64.49 --- Results --- 107.39/64.49 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 107.39/64.49 - StatisticsResult: Initial Icfg 107.39/64.49 49 locations, 71 edges 107.39/64.49 - StatisticsResult: Encoded RCFG 107.39/64.49 40 locations, 65 edges 107.39/64.49 * Results from de.uni_freiburg.informatik.ultimate.core: 107.39/64.49 - StatisticsResult: Toolchain Benchmarks 107.39/64.49 Benchmark results are: 107.39/64.49 * CDTParser took 0.15 ms. Allocated memory is still 649.6 MB. Free memory is still 584.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 107.39/64.49 * CACSL2BoogieTranslator took 317.19 ms. Allocated memory was 649.6 MB in the beginning and 666.9 MB in the end (delta: 17.3 MB). Free memory was 563.8 MB in the beginning and 630.8 MB in the end (delta: -67.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 50.3 GB. 107.39/64.49 * Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 666.9 MB. Free memory was 630.8 MB in the beginning and 628.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. 107.39/64.49 * Boogie Preprocessor took 23.47 ms. Allocated memory is still 666.9 MB. Free memory was 628.7 MB in the beginning and 627.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 107.39/64.49 * RCFGBuilder took 345.60 ms. Allocated memory is still 666.9 MB. Free memory was 627.6 MB in the beginning and 605.5 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. 107.39/64.49 * BlockEncodingV2 took 118.78 ms. Allocated memory is still 666.9 MB. Free memory was 605.5 MB in the beginning and 596.8 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. 107.39/64.49 * TraceAbstraction took 211.96 ms. Allocated memory is still 666.9 MB. Free memory was 596.8 MB in the beginning and 580.6 MB in the end (delta: 16.3 MB). Peak memory consumption was 16.3 MB. Max. memory is 50.3 GB. 107.39/64.49 * BuchiAutomizer took 59096.73 ms. Allocated memory was 666.9 MB in the beginning and 5.3 GB in the end (delta: 4.6 GB). Free memory was 580.6 MB in the beginning and 3.3 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 50.3 GB. 107.39/64.49 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 107.39/64.49 - AllSpecificationsHoldResult: All specifications hold 107.39/64.49 We were not able to verify any specifiation because the program does not contain any specification. 107.39/64.49 - InvariantResult [Line: 51]: Loop Invariant 107.39/64.49 Derived loop invariant: 1 107.39/64.49 - StatisticsResult: Ultimate Automizer benchmark data 107.39/64.49 CFG has 4 procedures, 40 locations, 0 error locations. SAFE Result, 0.1s 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=40occurred 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, 13 LocationsWithAnnotation, 34 PreInvPairs, 34 NumberOfFragments, 13 HoareAnnotationTreeSize, 34 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available 107.39/64.49 - StatisticsResult: Constructed decomposition of program 107.39/64.49 Your program was decomposed into 20 terminating modules (13 trivial, 0 deterministic, 7 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function \old(m) and consists of 11 locations. One nondeterministic module has affine ranking function m and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(m) and consists of 6 locations. One nondeterministic module has affine ranking function -1 * \old(n) and consists of 5 locations. One nondeterministic module has affine ranking function m and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 21 locations. One nondeterministic module has affine ranking function -1 * n and consists of 72 locations. 13 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 299 locations. 107.39/64.49 - StatisticsResult: Timing statistics 107.39/64.49 BüchiAutomizer plugin needed 59.0s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 26.3s. Construction of modules took 3.0s. Büchi inclusion checks took 27.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 16. Automata minimization 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 854 StatesRemovedByMinimization, 18 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.0s. Biggest automaton had 299 states and ocurred in iteration 14. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/19 HoareTripleCheckerStatistics: 732 SDtfs, 1056 SDslu, 2634 SDs, 0 SdLazy, 4018 SolverSat, 783 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT1 conc1 concLT2 SILN0 SILU0 SILI1 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf99 lsp82 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf91 smp100 dnf100 smp100 tf109 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 21 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 22.0s 107.39/64.49 - TerminationAnalysisResult: Nontermination possible 107.39/64.49 Buchi Automizer proved that your program is nonterminating for some inputs 107.39/64.49 - FixpointNonTerminationResult [Line: 30]: Nontermination argument in form of an infinite program execution. 107.39/64.49 Nontermination argument in form of an infinite execution 107.39/64.49 State at position 0 is 107.39/64.49 {} 107.39/64.49 State at position 1 is 107.39/64.49 {n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@188ed990=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c161933=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20cbf331=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d72be3b=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4155a354=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66587095=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@381e6746=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73bfe1d5=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2ab472f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@386633c3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ab177e=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@589758be=0} 107.39/64.49 - StatisticsResult: NonterminationArgumentStatistics 107.39/64.49 Fixpoint 107.39/64.49 - NonterminatingLassoResult [Line: 30]: Nonterminating execution 107.39/64.49 Found a nonterminating execution for the following lasso shaped sequence of statements. 107.39/64.49 Stem: 107.39/64.49 [L75] int n = __VERIFIER_nondet_int(); 107.39/64.49 [L76] COND FALSE !(n < 1 || n > 46340) 107.39/64.49 [L51] CALL is_prime_(n, n - 1) 107.39/64.49 [L56] COND FALSE !(n <= 1) 107.39/64.49 [L59] COND FALSE !(n == 2) 107.39/64.49 [L62] COND TRUE n > 2 107.39/64.49 [L63] COND FALSE !(m <= 1) 107.39/64.49 [L66] CALL multiple_of(n, m) 107.39/64.49 [L30] COND FALSE !(m < 0) 107.39/64.49 [L33] COND FALSE !(n < 0) 107.39/64.49 [L36] COND FALSE !(m == 0) 107.39/64.49 [L39] COND FALSE !(n == 0) 107.39/64.49 [L42] CALL multiple_of(n - m, m) 107.39/64.49 [L30] COND FALSE !(m < 0) 107.39/64.49 [L33] COND FALSE !(n < 0) 107.39/64.49 [L36] COND FALSE !(m == 0) 107.39/64.49 [L39] COND FALSE !(n == 0) 107.39/64.49 [L42] CALL multiple_of(n - m, m) 107.39/64.49 [L30] COND FALSE !(m < 0) 107.39/64.49 [L33] COND TRUE n < 0 107.39/64.49 [L34] CALL multiple_of(-n, m) 107.39/64.49 Loop: 107.39/64.49 [L30] COND FALSE !(m < 0) 107.39/64.49 [L33] COND FALSE !(n < 0) 107.39/64.49 [L36] COND FALSE !(m == 0) 107.39/64.49 [L39] COND FALSE !(n == 0) 107.39/64.49 [L42] CALL multiple_of(n - m, m) 107.39/64.49 [L30] COND FALSE !(m < 0) 107.39/64.49 [L33] COND TRUE n < 0 107.39/64.49 [L34] CALL multiple_of(-n, m) 107.39/64.49 End of lasso representation. 107.39/64.49 RESULT: Ultimate proved your program to be incorrect! 107.39/64.49 !SESSION 2019-03-28 12:23:58.000 ----------------------------------------------- 107.39/64.49 eclipse.buildId=unknown 107.39/64.49 java.version=1.8.0_181 107.39/64.49 java.vendor=Oracle Corporation 107.39/64.49 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 107.39/64.49 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 107.39/64.50 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 107.39/64.50 107.39/64.50 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:25:01.680 107.39/64.50 !MESSAGE The workspace will exit with unsaved changes in this session. 107.39/64.50 Received shutdown request... 107.39/64.50 Ultimate: 107.39/64.50 GTK+ Version Check 107.39/64.50 EOF