./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 82151ec4435da78821025b3100fe51201edc8f02 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:52:05,047 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:52:05,048 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:52:05,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:52:05,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:52:05,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:52:05,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:52:05,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:52:05,060 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:52:05,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:52:05,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:52:05,062 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:52:05,062 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:52:05,063 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:52:05,064 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:52:05,064 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:52:05,066 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:52:05,067 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:52:05,068 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:52:05,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:52:05,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:52:05,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:52:05,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:52:05,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:52:05,073 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:52:05,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:52:05,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:52:05,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:52:05,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:52:05,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:52:05,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:52:05,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:52:05,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:52:05,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:52:05,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:52:05,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:52:05,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 12:52:05,091 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:52:05,091 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:52:05,092 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:52:05,092 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:52:05,092 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:52:05,093 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 12:52:05,093 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 12:52:05,093 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 12:52:05,093 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 12:52:05,093 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 12:52:05,093 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 12:52:05,094 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 12:52:05,094 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 12:52:05,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 12:52:05,095 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:52:05,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:52:05,095 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 12:52:05,095 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:52:05,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 12:52:05,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:52:05,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:52:05,096 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 12:52:05,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:52:05,096 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:52:05,096 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 12:52:05,099 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 12:52:05,099 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 82151ec4435da78821025b3100fe51201edc8f02 [2018-11-28 12:52:05,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:52:05,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:52:05,125 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:52:05,126 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:52:05,126 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:52:05,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-28 12:52:05,165 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/data/8d2a837c8/f92ddbac2dba471f8490f1d6f5291b8b/FLAGb6eb9f5ec [2018-11-28 12:52:05,558 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:52:05,558 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-28 12:52:05,563 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/data/8d2a837c8/f92ddbac2dba471f8490f1d6f5291b8b/FLAGb6eb9f5ec [2018-11-28 12:52:05,572 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/data/8d2a837c8/f92ddbac2dba471f8490f1d6f5291b8b [2018-11-28 12:52:05,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:52:05,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:52:05,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:52:05,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:52:05,579 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:52:05,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3375cb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05, skipping insertion in model container [2018-11-28 12:52:05,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:52:05,601 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:52:05,715 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:52:05,718 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:52:05,734 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:52:05,744 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:52:05,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05 WrapperNode [2018-11-28 12:52:05,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:52:05,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:52:05,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:52:05,745 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:52:05,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:52:05,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:52:05,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:52:05,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:52:05,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... [2018-11-28 12:52:05,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:52:05,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:52:05,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:52:05,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:52:05,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2018-11-28 12:52:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2018-11-28 12:52:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-28 12:52:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-28 12:52:05,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:52:05,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:52:05,869 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2018-11-28 12:52:05,869 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2018-11-28 12:52:06,030 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:52:06,030 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-28 12:52:06,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:52:06 BoogieIcfgContainer [2018-11-28 12:52:06,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:52:06,031 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 12:52:06,031 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 12:52:06,033 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 12:52:06,033 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:52:06,034 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 12:52:05" (1/3) ... [2018-11-28 12:52:06,034 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79ec4c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:52:06, skipping insertion in model container [2018-11-28 12:52:06,034 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:52:06,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:52:05" (2/3) ... [2018-11-28 12:52:06,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79ec4c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 12:52:06, skipping insertion in model container [2018-11-28 12:52:06,035 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 12:52:06,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:52:06" (3/3) ... [2018-11-28 12:52:06,036 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-28 12:52:06,072 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:52:06,072 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 12:52:06,072 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 12:52:06,072 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 12:52:06,072 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:52:06,072 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:52:06,072 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 12:52:06,072 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:52:06,073 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 12:52:06,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-28 12:52:06,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 12:52:06,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:06,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:06,107 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:52:06,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:06,108 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 12:52:06,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2018-11-28 12:52:06,111 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 12:52:06,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:06,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:06,112 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:52:06,112 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:06,116 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 13#L76true assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 10#L51true call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 12#is_prime_ENTRYtrue [2018-11-28 12:52:06,117 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 41#L56true assume !(~n <= 1); 35#L59true assume !(2 == ~n); 25#L62true assume ~n > 2; 39#L63true assume !(~m <= 1); 32#L66true call #t~ret6 := multiple_of(~n, ~m);< 51#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 31#L30true assume !(~m < 0); 24#L33true assume !(~n < 0); 37#L36true assume 0 == ~m;#res := 0; 27#multiple_ofFINALtrue assume true; 46#multiple_ofEXITtrue >#121#return; 30#L66-1true assume !(0 == #t~ret6);havoc #t~ret6; 23#L69true call #t~ret7 := is_prime_(~n, ~m - 1);< 12#is_prime_ENTRYtrue [2018-11-28 12:52:06,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2018-11-28 12:52:06,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2018-11-28 12:52:06,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:52:06,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:52:06,250 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:52:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:52:06,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:52:06,264 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-11-28 12:52:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:06,372 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-11-28 12:52:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:52:06,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2018-11-28 12:52:06,377 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 12:52:06,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2018-11-28 12:52:06,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-28 12:52:06,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-28 12:52:06,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2018-11-28 12:52:06,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:52:06,386 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-28 12:52:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2018-11-28 12:52:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-28 12:52:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 12:52:06,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2018-11-28 12:52:06,413 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-11-28 12:52:06,414 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2018-11-28 12:52:06,414 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 12:52:06,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2018-11-28 12:52:06,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 12:52:06,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:06,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:06,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:52:06,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:06,415 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 143#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 132#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 140#is_prime_ENTRY [2018-11-28 12:52:06,415 INFO L796 eck$LassoCheckResult]: Loop: 140#is_prime_ENTRY ~n := #in~n;~m := #in~m; 141#L56 assume !(~n <= 1); 131#L59 assume !(2 == ~n); 135#L62 assume ~n > 2; 142#L63 assume !(~m <= 1); 118#L66 call #t~ret6 := multiple_of(~n, ~m);< 128#multiple_ofENTRY ~n := #in~n;~m := #in~m; 153#L30 assume !(~m < 0); 149#L33 assume !(~n < 0); 138#L36 assume !(0 == ~m); 139#L39 assume 0 == ~n;#res := 1; 122#multiple_ofFINAL assume true; 150#multiple_ofEXIT >#121#return; 151#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 133#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 140#is_prime_ENTRY [2018-11-28 12:52:06,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2018-11-28 12:52:06,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2018-11-28 12:52:06,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:06,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:06,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:52:06,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 12:52:06,471 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 12:52:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:52:06,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:52:06,472 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-28 12:52:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:06,518 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2018-11-28 12:52:06,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:52:06,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2018-11-28 12:52:06,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 12:52:06,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2018-11-28 12:52:06,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-28 12:52:06,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-28 12:52:06,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2018-11-28 12:52:06,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 12:52:06,523 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2018-11-28 12:52:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2018-11-28 12:52:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-28 12:52:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 12:52:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2018-11-28 12:52:06,526 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-28 12:52:06,526 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2018-11-28 12:52:06,527 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 12:52:06,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2018-11-28 12:52:06,527 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-28 12:52:06,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:06,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:06,528 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 12:52:06,528 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:06,528 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 233#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 222#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 230#is_prime_ENTRY [2018-11-28 12:52:06,528 INFO L796 eck$LassoCheckResult]: Loop: 230#is_prime_ENTRY ~n := #in~n;~m := #in~m; 231#L56 assume !(~n <= 1); 221#L59 assume !(2 == ~n); 225#L62 assume ~n > 2; 232#L63 assume !(~m <= 1); 208#L66 call #t~ret6 := multiple_of(~n, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume !(0 == ~n); 209#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume 0 == ~n;#res := 1; 212#multiple_ofFINAL assume true; 241#multiple_ofEXIT >#111#return; 234#L42-1 #res := #t~ret4;havoc #t~ret4; 235#multiple_ofFINAL assume true; 246#multiple_ofEXIT >#121#return; 243#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 223#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 230#is_prime_ENTRY [2018-11-28 12:52:06,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2018-11-28 12:52:06,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2018-11-28 12:52:06,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:06,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2018-11-28 12:52:06,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:06,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:52:06,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:52:06,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:52:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:06,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:52:06,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:52:06,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 12:52:06,932 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:06,933 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:06,933 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:06,933 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:06,933 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:06,933 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:06,933 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:06,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:06,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-28 12:52:06,934 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:06,934 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:06,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:06,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:06,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:06,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:06,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:06,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,001 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:07,002 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,021 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,036 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,038 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,038 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,052 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,054 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,055 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,071 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,071 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,093 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:07,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,138 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:07,139 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:07,139 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:07,139 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:07,139 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:07,139 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:07,139 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,140 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:07,140 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:07,140 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-28 12:52:07,140 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:07,140 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:07,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,228 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:07,232 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:07,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:07,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:07,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:07,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:07,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:07,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:07,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:07,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:07,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:07,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:07,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:07,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:07,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:07,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:07,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:07,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:07,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:07,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:07,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:07,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:07,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:07,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:07,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:07,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:07,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:07,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:07,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:07,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:07,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:07,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:07,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:07,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:07,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:07,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:07,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:07,247 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:07,252 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 12:52:07,252 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 12:52:07,254 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:07,254 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:07,254 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:07,255 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2018-11-28 12:52:07,255 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:07,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:07,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:07,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:52:07,433 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-28 12:52:07,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-28 12:52:07,666 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 174 states and 238 transitions. Complement of second has 40 states. [2018-11-28 12:52:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 12:52:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2018-11-28 12:52:07,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2018-11-28 12:52:07,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:07,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2018-11-28 12:52:07,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:07,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2018-11-28 12:52:07,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:07,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2018-11-28 12:52:07,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-28 12:52:07,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2018-11-28 12:52:07,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2018-11-28 12:52:07,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-28 12:52:07,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2018-11-28 12:52:07,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:07,682 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2018-11-28 12:52:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2018-11-28 12:52:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2018-11-28 12:52:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-28 12:52:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2018-11-28 12:52:07,692 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2018-11-28 12:52:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 12:52:07,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 12:52:07,693 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 9 states. [2018-11-28 12:52:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:07,825 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2018-11-28 12:52:07,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 12:52:07,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2018-11-28 12:52:07,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-28 12:52:07,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2018-11-28 12:52:07,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2018-11-28 12:52:07,831 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2018-11-28 12:52:07,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2018-11-28 12:52:07,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:07,832 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2018-11-28 12:52:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2018-11-28 12:52:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2018-11-28 12:52:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 12:52:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2018-11-28 12:52:07,839 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-28 12:52:07,839 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2018-11-28 12:52:07,840 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 12:52:07,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2018-11-28 12:52:07,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-28 12:52:07,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:07,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:07,841 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:07,841 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:52:07,842 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 965#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 942#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 957#is_prime_ENTRY ~n := #in~n;~m := #in~m; 959#L56 assume !(~n <= 1); 941#L59 assume !(2 == ~n); 944#L62 assume ~n > 2; 962#L63 assume !(~m <= 1); 936#L66 call #t~ret6 := multiple_of(~n, ~m);< 994#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1022#L30 assume ~m < 0; 969#L31 [2018-11-28 12:52:07,842 INFO L796 eck$LassoCheckResult]: Loop: 969#L31 call #t~ret2 := multiple_of(~n, -~m);< 973#multiple_ofENTRY ~n := #in~n;~m := #in~m; 990#L30 assume ~m < 0; 969#L31 [2018-11-28 12:52:07,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:07,842 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2018-11-28 12:52:07,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:07,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:07,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:07,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:07,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:07,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:52:07,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:52:07,861 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:52:07,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:07,861 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2018-11-28 12:52:07,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:07,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:07,905 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:07,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:07,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:07,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:07,905 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:07,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:07,906 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:07,906 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-28 12:52:07,906 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:07,906 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:07,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:07,942 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:07,942 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,946 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,946 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,964 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,964 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,980 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,980 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:07,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:07,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:07,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:07,997 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,012 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,030 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:08,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,606 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:08,608 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:08,608 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:08,608 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:08,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:08,608 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:08,609 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,609 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:08,609 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:08,609 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-28 12:52:08,609 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:08,609 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:08,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:08,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:08,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:08,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:08,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:08,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:08,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:08,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:08,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:08,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:08,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:08,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:08,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:08,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:08,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:08,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:08,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:08,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:08,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:08,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:08,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:08,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:08,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:08,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:08,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:08,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:08,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:08,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:08,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:08,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:08,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:08,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:08,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:08,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:08,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:08,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:08,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:08,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:08,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:08,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:08,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:08,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:08,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:08,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:08,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:08,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:08,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:08,657 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-28 12:52:08,657 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:52:08,657 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:08,657 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:08,658 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:08,658 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2018-11-28 12:52:08,658 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:08,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:08,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:08,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:08,693 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:52:08,693 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-28 12:52:08,735 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 209 states and 271 transitions. Complement of second has 18 states. [2018-11-28 12:52:08,736 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 [2018-11-28 12:52:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:52:08,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-28 12:52:08,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 12:52:08,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:08,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 12:52:08,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:08,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 12:52:08,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:08,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2018-11-28 12:52:08,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2018-11-28 12:52:08,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2018-11-28 12:52:08,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-28 12:52:08,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-28 12:52:08,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2018-11-28 12:52:08,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:08,743 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2018-11-28 12:52:08,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2018-11-28 12:52:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-11-28 12:52:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 12:52:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2018-11-28 12:52:08,749 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2018-11-28 12:52:08,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:52:08,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:52:08,750 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2018-11-28 12:52:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:08,791 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2018-11-28 12:52:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 12:52:08,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2018-11-28 12:52:08,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-28 12:52:08,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2018-11-28 12:52:08,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-28 12:52:08,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2018-11-28 12:52:08,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2018-11-28 12:52:08,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:08,795 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2018-11-28 12:52:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2018-11-28 12:52:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-11-28 12:52:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 12:52:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-11-28 12:52:08,800 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-28 12:52:08,800 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-28 12:52:08,800 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 12:52:08,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2018-11-28 12:52:08,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-28 12:52:08,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:08,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:08,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:08,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:52:08,802 INFO L794 eck$LassoCheckResult]: Stem: 1623#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 1605#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 1585#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1597#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1599#L56 assume ~n <= 1;#res := 0; 1586#is_prime_FINAL assume true; 1632#is_prime_EXIT >#117#return; 1592#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1582#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 1583#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1615#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 1616#L95 assume main_#t~short13; 1575#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1591#multENTRY [2018-11-28 12:52:08,802 INFO L796 eck$LassoCheckResult]: Loop: 1591#multENTRY ~n := #in~n;~m := #in~m; 1573#L16 assume ~m < 0; 1576#L17 call #t~ret0 := mult(~n, -~m);< 1591#multENTRY [2018-11-28 12:52:08,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2018-11-28 12:52:08,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:08,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:08,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:52:08,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:52:08,844 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:52:08,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2018-11-28 12:52:08,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:08,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:08,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:08,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:08,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:08,870 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:08,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:08,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:08,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:08,870 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:08,870 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,870 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:08,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:08,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-28 12:52:08,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:08,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:08,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:08,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:08,907 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,909 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,909 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,914 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:08,914 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,931 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:08,931 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,945 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:08,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:08,963 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,978 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,978 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,980 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:08,980 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:08,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:08,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:08,997 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:08,997 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,011 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:09,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,047 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:09,048 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:09,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:09,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:09,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:09,048 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:09,048 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,048 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:09,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:09,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-28 12:52:09,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:09,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:09,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,072 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:09,072 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:09,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,081 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,086 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:09,087 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-28 12:52:09,087 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:52:09,087 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:09,087 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:09,087 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:09,087 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2018-11-28 12:52:09,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:09,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:09,152 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:52:09,152 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2018-11-28 12:52:09,220 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34. Second operand 5 states. Result 142 states and 176 transitions. Complement of second has 14 states. [2018-11-28 12:52:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:52:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-28 12:52:09,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 12:52:09,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:09,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-28 12:52:09,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:09,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 12:52:09,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:09,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2018-11-28 12:52:09,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-28 12:52:09,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2018-11-28 12:52:09,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2018-11-28 12:52:09,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-28 12:52:09,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2018-11-28 12:52:09,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:09,226 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2018-11-28 12:52:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2018-11-28 12:52:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2018-11-28 12:52:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 12:52:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2018-11-28 12:52:09,232 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2018-11-28 12:52:09,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:52:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:52:09,232 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2018-11-28 12:52:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:09,264 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2018-11-28 12:52:09,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:52:09,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2018-11-28 12:52:09,265 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-28 12:52:09,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2018-11-28 12:52:09,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-28 12:52:09,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-28 12:52:09,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2018-11-28 12:52:09,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:09,267 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2018-11-28 12:52:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2018-11-28 12:52:09,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-11-28 12:52:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-28 12:52:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2018-11-28 12:52:09,271 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-11-28 12:52:09,271 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2018-11-28 12:52:09,271 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 12:52:09,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2018-11-28 12:52:09,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-28 12:52:09,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:09,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:09,272 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:09,272 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 12:52:09,273 INFO L794 eck$LassoCheckResult]: Stem: 2228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 2206#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 2185#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2195#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2198#L56 assume !(~n <= 1); 2241#L59 assume !(2 == ~n); 2242#L62 assume ~n > 2; 2202#L63 assume !(~m <= 1); 2173#L66 call #t~ret6 := multiple_of(~n, ~m);< 2233#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2231#L30 assume !(~m < 0); 2219#L33 assume ~n < 0; 2160#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2018-11-28 12:52:09,273 INFO L796 eck$LassoCheckResult]: Loop: 2175#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2235#L30 assume !(~m < 0); 2260#L33 assume ~n < 0; 2161#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2018-11-28 12:52:09,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,273 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2018-11-28 12:52:09,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:09,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:52:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 12:52:09,307 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:52:09,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2018-11-28 12:52:09,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,334 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:09,335 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:09,335 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:09,335 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:09,335 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:09,335 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,335 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:09,335 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:09,335 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-28 12:52:09,335 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:09,335 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:09,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,371 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:09,371 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,376 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:09,376 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:09,395 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,410 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,411 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:09,411 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,426 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,442 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:09,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,461 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:09,462 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:09,462 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:09,462 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:09,462 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:09,462 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:09,462 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,462 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:09,463 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:09,463 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-28 12:52:09,463 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:09,463 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:09,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:09,493 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:09,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:09,502 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-28 12:52:09,502 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:52:09,502 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:09,502 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:09,503 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:09,503 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2018-11-28 12:52:09,503 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:09,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:09,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 12:52:09,543 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-28 12:52:09,573 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 270 states and 352 transitions. Complement of second has 13 states. [2018-11-28 12:52:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 12:52:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-28 12:52:09,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-28 12:52:09,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:09,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2018-11-28 12:52:09,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:09,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2018-11-28 12:52:09,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:09,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2018-11-28 12:52:09,578 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-28 12:52:09,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2018-11-28 12:52:09,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-28 12:52:09,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-28 12:52:09,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2018-11-28 12:52:09,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:09,581 INFO L705 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2018-11-28 12:52:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2018-11-28 12:52:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2018-11-28 12:52:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-28 12:52:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2018-11-28 12:52:09,589 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2018-11-28 12:52:09,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 12:52:09,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 12:52:09,589 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2018-11-28 12:52:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:09,658 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2018-11-28 12:52:09,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:52:09,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 279 transitions. [2018-11-28 12:52:09,660 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-28 12:52:09,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 279 transitions. [2018-11-28 12:52:09,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-28 12:52:09,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-28 12:52:09,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 279 transitions. [2018-11-28 12:52:09,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:09,662 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-28 12:52:09,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 279 transitions. [2018-11-28 12:52:09,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-11-28 12:52:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-28 12:52:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2018-11-28 12:52:09,669 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-28 12:52:09,669 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2018-11-28 12:52:09,670 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 12:52:09,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 279 transitions. [2018-11-28 12:52:09,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-28 12:52:09,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:09,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:09,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:09,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:52:09,671 INFO L794 eck$LassoCheckResult]: Stem: 3156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3126#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3114#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3115#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3118#L56 assume !(~n <= 1); 3171#L59 assume !(2 == ~n); 3172#L62 assume ~n > 2; 3173#L63 assume !(~m <= 1); 3161#L66 call #t~ret6 := multiple_of(~n, ~m);< 3168#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3160#L30 assume !(~m < 0); 3162#L33 assume !(~n < 0); 3226#L36 assume !(0 == ~m); 3224#L39 assume !(0 == ~n); 3072#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2018-11-28 12:52:09,671 INFO L796 eck$LassoCheckResult]: Loop: 3194#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3192#L30 assume !(~m < 0); 3186#L33 assume !(~n < 0); 3187#L36 assume !(0 == ~m); 3225#L39 assume !(0 == ~n); 3071#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2018-11-28 12:52:09,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2018-11-28 12:52:09,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:09,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,680 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2018-11-28 12:52:09,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:09,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2018-11-28 12:52:09,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:09,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:09,740 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:09,740 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:09,740 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:09,740 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:09,740 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:09,740 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,740 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:09,741 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:09,741 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-28 12:52:09,741 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:09,741 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:09,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,790 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:09,790 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,794 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:09,794 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,808 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:09,808 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:09,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:09,902 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:09,903 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:09,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:09,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:09,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:09,904 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:09,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:09,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:09,904 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:09,904 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-28 12:52:09,904 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:09,904 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:09,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:09,951 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:09,951 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:09,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:09,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:09,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:09,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:09,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:09,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:09,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:09,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:09,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:09,957 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:09,958 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:52:09,958 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:52:09,959 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:09,959 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:09,959 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:09,959 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2018-11-28 12:52:09,959 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:09,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:09,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:10,036 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:52:10,036 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75 Second operand 6 states. [2018-11-28 12:52:10,090 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75. Second operand 6 states. Result 313 states and 413 transitions. Complement of second has 21 states. [2018-11-28 12:52:10,093 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 [2018-11-28 12:52:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:52:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-28 12:52:10,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2018-11-28 12:52:10,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:10,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-28 12:52:10,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:10,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2018-11-28 12:52:10,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:10,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 413 transitions. [2018-11-28 12:52:10,096 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-28 12:52:10,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 282 states and 365 transitions. [2018-11-28 12:52:10,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2018-11-28 12:52:10,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2018-11-28 12:52:10,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 365 transitions. [2018-11-28 12:52:10,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:10,099 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 365 transitions. [2018-11-28 12:52:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 365 transitions. [2018-11-28 12:52:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 249. [2018-11-28 12:52:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 12:52:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 323 transitions. [2018-11-28 12:52:10,105 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-11-28 12:52:10,105 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2018-11-28 12:52:10,105 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 12:52:10,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 323 transitions. [2018-11-28 12:52:10,106 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-28 12:52:10,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:10,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:10,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:10,107 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 12:52:10,107 INFO L794 eck$LassoCheckResult]: Stem: 3796#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3766#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3754#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3755#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3758#L56 assume !(~n <= 1); 3845#L59 assume 2 == ~n;#res := 1; 3843#is_prime_FINAL assume true; 3810#is_prime_EXIT >#117#return; 3746#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3732#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 3733#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3776#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 3777#L95 assume main_#t~short13; 3721#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3756#multENTRY ~n := #in~n;~m := #in~m; 3720#L16 assume !(~m < 0); 3723#L19 [2018-11-28 12:52:10,107 INFO L796 eck$LassoCheckResult]: Loop: 3723#L19 assume !(0 == ~m); 3772#L22 assume !(1 == ~m); 3743#L25 call #t~ret1 := mult(~n, ~m - 1);< 3745#multENTRY ~n := #in~n;~m := #in~m; 3784#L16 assume !(~m < 0); 3723#L19 [2018-11-28 12:52:10,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:10,107 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2018-11-28 12:52:10,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:10,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:10,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:10,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2018-11-28 12:52:10,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:10,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:10,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2018-11-28 12:52:10,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:10,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:10,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:10,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:10,183 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:10,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:10,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:10,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:10,184 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:10,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:10,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:10,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:10,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-28 12:52:10,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:10,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:10,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,226 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:10,226 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:10,237 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:10,237 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:10,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:10,240 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:10,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:10,264 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:10,266 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:10,266 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:10,290 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:10,290 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:10,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:10,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:10,993 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:10,994 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:10,994 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:10,994 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:10,994 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:10,994 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:10,995 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:10,995 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:10,995 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:10,995 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-28 12:52:10,995 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:10,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:10,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:10,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,028 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:11,028 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:11,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:11,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:11,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:11,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:11,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:11,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:11,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:11,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:11,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:11,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:11,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:11,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:11,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:11,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:11,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:11,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:11,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:11,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:11,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:11,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:11,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:11,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:11,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:11,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:11,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:11,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:11,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:11,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:11,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:11,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:11,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:11,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:11,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:11,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:11,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:11,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:11,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:11,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:11,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:11,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:11,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:11,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:11,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:11,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:11,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:11,038 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:52:11,038 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:52:11,038 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:11,038 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:11,038 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:11,038 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-28 12:52:11,039 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:11,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:11,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:11,083 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:52:11,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86 Second operand 6 states. [2018-11-28 12:52:11,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86. Second operand 6 states. Result 273 states and 350 transitions. Complement of second has 17 states. [2018-11-28 12:52:11,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:52:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2018-11-28 12:52:11,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-28 12:52:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:11,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-28 12:52:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:11,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-28 12:52:11,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:11,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 350 transitions. [2018-11-28 12:52:11,154 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-28 12:52:11,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 272 states and 349 transitions. [2018-11-28 12:52:11,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2018-11-28 12:52:11,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-28 12:52:11,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 349 transitions. [2018-11-28 12:52:11,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:11,157 INFO L705 BuchiCegarLoop]: Abstraction has 272 states and 349 transitions. [2018-11-28 12:52:11,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 349 transitions. [2018-11-28 12:52:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2018-11-28 12:52:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-28 12:52:11,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 335 transitions. [2018-11-28 12:52:11,163 INFO L728 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-11-28 12:52:11,163 INFO L608 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2018-11-28 12:52:11,163 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 12:52:11,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 335 transitions. [2018-11-28 12:52:11,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-28 12:52:11,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:11,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:11,165 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:11,165 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 12:52:11,166 INFO L794 eck$LassoCheckResult]: Stem: 4428#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 4393#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 4380#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4381#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4384#L56 assume !(~n <= 1); 4444#L59 assume 2 == ~n;#res := 1; 4443#is_prime_FINAL assume true; 4441#is_prime_EXIT >#117#return; 4373#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4357#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 4358#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4407#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4408#L95 assume main_#t~short13; 4348#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4382#multENTRY ~n := #in~n;~m := #in~m; 4345#L16 assume !(~m < 0); 4347#L19 assume !(0 == ~m); 4401#L22 assume !(1 == ~m); 4409#L25 call #t~ret1 := mult(~n, ~m - 1);< 4590#multENTRY ~n := #in~n;~m := #in~m; 4449#L16 assume ~m < 0; 4369#L17 [2018-11-28 12:52:11,166 INFO L796 eck$LassoCheckResult]: Loop: 4369#L17 call #t~ret0 := mult(~n, -~m);< 4370#multENTRY ~n := #in~n;~m := #in~m; 4450#L16 assume ~m < 0; 4369#L17 [2018-11-28 12:52:11,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:11,166 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2018-11-28 12:52:11,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:11,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:11,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:11,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:52:11,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 12:52:11,198 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:52:11,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2018-11-28 12:52:11,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:11,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:11,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:11,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:11,224 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:11,224 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:11,224 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:11,224 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:11,224 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:11,224 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:11,224 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:11,224 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:11,224 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-28 12:52:11,224 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:11,224 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:11,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:11,251 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:11,251 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:11,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:11,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:11,257 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:11,257 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:11,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:11,271 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:11,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:11,273 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:11,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:11,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:11,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:11,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0, mult_#in~n=0} Honda state: {mult_~n=0, mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:11,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:11,304 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:11,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:11,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:12,234 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:12,235 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:12,235 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:12,235 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:12,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:12,236 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:12,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:12,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:12,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:12,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-28 12:52:12,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:12,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:12,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,264 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:12,264 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:12,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:12,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:12,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:12,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:12,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:12,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:12,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:12,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:12,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:12,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:12,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:12,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:12,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:12,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:12,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:12,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:12,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:12,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:12,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:12,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:12,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:12,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:12,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:12,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:12,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:12,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:12,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 12:52:12,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:12,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:12,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:12,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:12,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:12,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:12,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:12,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:12,272 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:12,273 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-28 12:52:12,273 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 12:52:12,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:12,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:12,274 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:12,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-28 12:52:12,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:12,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:12,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:12,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:12,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:12,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-28 12:52:12,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89 Second operand 5 states. [2018-11-28 12:52:12,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89. Second operand 5 states. Result 300 states and 381 transitions. Complement of second has 11 states. [2018-11-28 12:52:12,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 12:52:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 12:52:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-28 12:52:12,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2018-11-28 12:52:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2018-11-28 12:52:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:12,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2018-11-28 12:52:12,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:12,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 381 transitions. [2018-11-28 12:52:12,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-28 12:52:12,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 290 states and 371 transitions. [2018-11-28 12:52:12,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-28 12:52:12,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-28 12:52:12,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 371 transitions. [2018-11-28 12:52:12,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:12,381 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 371 transitions. [2018-11-28 12:52:12,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 371 transitions. [2018-11-28 12:52:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2018-11-28 12:52:12,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-28 12:52:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2018-11-28 12:52:12,390 INFO L728 BuchiCegarLoop]: Abstraction has 277 states and 357 transitions. [2018-11-28 12:52:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 12:52:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 12:52:12,390 INFO L87 Difference]: Start difference. First operand 277 states and 357 transitions. Second operand 5 states. [2018-11-28 12:52:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:12,426 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2018-11-28 12:52:12,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 12:52:12,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 348 transitions. [2018-11-28 12:52:12,428 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-28 12:52:12,429 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 196 states and 236 transitions. [2018-11-28 12:52:12,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-28 12:52:12,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-28 12:52:12,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2018-11-28 12:52:12,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:12,430 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2018-11-28 12:52:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2018-11-28 12:52:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2018-11-28 12:52:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-28 12:52:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2018-11-28 12:52:12,433 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-28 12:52:12,433 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2018-11-28 12:52:12,433 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 12:52:12,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2018-11-28 12:52:12,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 12:52:12,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:12,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:12,434 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:12,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 12:52:12,434 INFO L794 eck$LassoCheckResult]: Stem: 5597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 5598#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 5569#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5585#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5586#L56 assume !(~n <= 1); 5680#L59 assume !(2 == ~n); 5679#L62 assume ~n > 2; 5678#L63 assume !(~m <= 1); 5666#L66 call #t~ret6 := multiple_of(~n, ~m);< 5675#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5673#L30 assume !(~m < 0); 5671#L33 assume !(~n < 0); 5670#L36 assume !(0 == ~m); 5668#L39 assume !(0 == ~n); 5612#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5664#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5663#L30 assume !(~m < 0); 5712#L33 assume ~n < 0; 5555#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5692#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5606#L30 assume !(~m < 0); 5552#L33 assume !(~n < 0); 5554#L36 [2018-11-28 12:52:12,435 INFO L796 eck$LassoCheckResult]: Loop: 5554#L36 assume !(0 == ~m); 5582#L39 assume !(0 == ~n); 5574#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5573#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5711#L30 assume !(~m < 0); 5702#L33 assume !(~n < 0); 5554#L36 [2018-11-28 12:52:12,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2018-11-28 12:52:12,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:12,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:12,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:12,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:12,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:52:12,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 12:52:12,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:12,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:52:12,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 12:52:12,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 12:52:12,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2018-11-28 12:52:12,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:12,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:12,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:12,566 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:12,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:12,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:12,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:12,566 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 12:52:12,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:12,566 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:12,566 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:12,566 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-28 12:52:12,566 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:12,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:12,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:12,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:12,610 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:12,613 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:12,613 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:12,614 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 12:52:12,615 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: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:12,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 12:52:12,629 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:12,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 12:52:12,647 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 12:52:13,943 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 12:52:13,945 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 12:52:13,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 12:52:13,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 12:52:13,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 12:52:13,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 12:52:13,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 12:52:13,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 12:52:13,945 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 12:52:13,945 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-28 12:52:13,945 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 12:52:13,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 12:52:13,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:13,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:13,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:13,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:13,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 12:52:13,992 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 12:52:13,993 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 12:52:13,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 12:52:13,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 12:52:13,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 12:52:13,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 12:52:13,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 12:52:13,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 12:52:13,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 12:52:13,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 12:52:13,996 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 12:52:13,997 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 12:52:13,998 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 12:52:13,998 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 12:52:13,998 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 12:52:13,998 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 12:52:13,998 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2018-11-28 12:52:13,998 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 12:52:14,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:14,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:14,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:14,089 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:52:14,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-28 12:52:14,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2018-11-28 12:52:14,150 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 [2018-11-28 12:52:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:52:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:52:14,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 12:52:14,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:14,151 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:52:14,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:14,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:14,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:14,209 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 12:52:14,209 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-28 12:52:14,290 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2018-11-28 12:52:14,290 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 [2018-11-28 12:52:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:52:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-28 12:52:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 12:52:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:14,291 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 12:52:14,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:14,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:52:14,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:52:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:52:14,353 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 5 loop predicates [2018-11-28 12:52:14,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-28 12:52:14,452 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 265 states and 319 transitions. Complement of second has 16 states. [2018-11-28 12:52:14,452 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 [2018-11-28 12:52:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 12:52:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-28 12:52:14,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 12:52:14,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:14,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2018-11-28 12:52:14,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:14,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2018-11-28 12:52:14,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 12:52:14,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2018-11-28 12:52:14,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 12:52:14,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2018-11-28 12:52:14,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-28 12:52:14,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-28 12:52:14,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2018-11-28 12:52:14,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:14,458 INFO L705 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2018-11-28 12:52:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2018-11-28 12:52:14,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2018-11-28 12:52:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-28 12:52:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2018-11-28 12:52:14,475 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2018-11-28 12:52:14,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 12:52:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 12:52:14,475 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2018-11-28 12:52:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:52:14,533 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2018-11-28 12:52:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 12:52:14,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2018-11-28 12:52:14,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 12:52:14,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2018-11-28 12:52:14,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-28 12:52:14,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-28 12:52:14,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2018-11-28 12:52:14,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 12:52:14,536 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2018-11-28 12:52:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2018-11-28 12:52:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2018-11-28 12:52:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-28 12:52:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2018-11-28 12:52:14,540 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-11-28 12:52:14,540 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2018-11-28 12:52:14,540 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 12:52:14,540 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2018-11-28 12:52:14,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 12:52:14,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 12:52:14,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 12:52:14,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:14,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 12:52:14,542 INFO L794 eck$LassoCheckResult]: Stem: 7270#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 7271#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 7233#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7255#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7256#L56 assume !(~n <= 1); 7278#L59 assume !(2 == ~n); 7261#L62 assume ~n > 2; 7262#L63 assume !(~m <= 1); 7251#L66 call #t~ret6 := multiple_of(~n, ~m);< 7281#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7275#L30 assume !(~m < 0); 7276#L33 assume !(~n < 0); 7250#L36 assume !(0 == ~m); 7252#L39 assume !(0 == ~n); 7266#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7334#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7333#L30 assume !(~m < 0); 7332#L33 assume !(~n < 0); 7329#L36 assume !(0 == ~m); 7265#L39 assume !(0 == ~n); 7241#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7288#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7318#L30 assume !(~m < 0); 7316#L33 assume ~n < 0; 7240#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7242#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7325#L30 assume !(~m < 0); 7324#L33 assume !(~n < 0); 7313#L36 [2018-11-28 12:52:14,542 INFO L796 eck$LassoCheckResult]: Loop: 7313#L36 assume !(0 == ~m); 7321#L39 assume !(0 == ~n); 7300#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7319#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7317#L30 assume !(~m < 0); 7299#L33 assume ~n < 0; 7301#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7315#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7314#L30 assume !(~m < 0); 7312#L33 assume !(~n < 0); 7313#L36 [2018-11-28 12:52:14,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2018-11-28 12:52:14,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:14,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:14,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:14,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:14,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:14,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2018-11-28 12:52:14,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:14,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:52:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:14,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:52:14,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2018-11-28 12:52:14,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:52:14,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:52:14,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:14,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:52:14,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:52:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:52:14,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 12:52:14 BoogieIcfgContainer [2018-11-28 12:52:14,933 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 12:52:14,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:52:14,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:52:14,934 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:52:14,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:52:06" (3/4) ... [2018-11-28 12:52:14,937 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 12:52:14,966 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f22b374-97ed-4ca9-a5d2-d02f57f7389d/bin-2019/uautomizer/witness.graphml [2018-11-28 12:52:14,966 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:52:14,967 INFO L168 Benchmark]: Toolchain (without parser) took 9391.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.2 MB). Free memory was 958.7 MB in the beginning and 1.2 GB in the end (delta: -218.1 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:14,968 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:52:14,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.26 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:14,968 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.80 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:14,969 INFO L168 Benchmark]: Boogie Preprocessor took 58.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.1 MB in the beginning and 1.2 GB in the end (delta: -221.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:14,969 INFO L168 Benchmark]: RCFGBuilder took 199.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:14,969 INFO L168 Benchmark]: BuchiAutomizer took 8902.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.9 MB). Peak memory consumption was 139.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:52:14,969 INFO L168 Benchmark]: Witness Printer took 32.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:52:14,971 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.26 ms. Allocated memory is still 1.0 GB. Free memory was 958.7 MB in the beginning and 947.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.80 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 945.1 MB in the beginning and 1.2 GB in the end (delta: -221.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8902.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -30.9 MB). Peak memory consumption was 139.0 MB. Max. memory is 11.5 GB. * Witness Printer took 32.63 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 7 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 9 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(n) and consists of 4 locations. One deterministic module has affine ranking function \old(n) and consists of 6 locations. One deterministic module has affine ranking function m and consists of 6 locations. One deterministic module has affine ranking function m and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 6.5s. Construction of modules took 0.6s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 300 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 259 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 694 SDtfs, 704 SDslu, 1147 SDs, 0 SdLazy, 884 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT5 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf99 lsp81 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq175 hnf92 smp90 dnf100 smp100 tf109 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 36]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c758aef=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@69f87540=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@74b16a0b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@55699d51=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29f46e01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52d58863=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2496020d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@476f27b7=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@35b1879b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@584d27b6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@694928f2=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@3dd5d5c2=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L75] int n = __VERIFIER_nondet_int(); [L76] COND FALSE !(n < 1 || n > 46340) [L51] CALL is_prime_(n, n - 1) [L56] COND FALSE !(n <= 1) [L59] COND FALSE !(n == 2) [L62] COND TRUE n > 2 [L63] COND FALSE !(m <= 1) [L66] CALL multiple_of(n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) Loop: [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...