./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-1dbac8b [2018-11-10 05:18:39,487 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:18:39,488 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:18:39,496 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:18:39,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:18:39,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:18:39,497 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:18:39,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:18:39,500 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:18:39,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:18:39,501 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:18:39,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:18:39,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:18:39,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:18:39,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:18:39,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:18:39,504 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:18:39,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:18:39,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:18:39,508 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:18:39,508 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:18:39,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:18:39,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:18:39,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:18:39,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:18:39,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:18:39,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:18:39,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:18:39,514 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:18:39,515 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:18:39,515 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:18:39,515 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:18:39,516 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:18:39,516 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:18:39,516 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:18:39,517 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:18:39,517 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 05:18:39,528 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:18:39,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:18:39,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 05:18:39,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 05:18:39,530 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 05:18:39,530 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 05:18:39,530 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 05:18:39,530 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 05:18:39,530 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 05:18:39,530 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 05:18:39,530 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 05:18:39,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:18:39,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:18:39,531 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 05:18:39,531 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:18:39,531 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:18:39,531 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 05:18:39,532 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 05:18:39,532 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:18:39,533 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:18:39,533 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 05:18:39,533 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:18:39,533 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 05:18:39,533 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 05:18:39,534 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 05:18:39,534 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:39,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:18:39,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:18:39,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:18:39,567 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:18:39,567 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:18:39,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/../../sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-10 05:18:39,604 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/data/fe4b9c1a1/41c0e2fb44e2467a96ac523015abee3b/FLAGa6c356805 [2018-11-10 05:18:39,910 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:18:39,911 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/sv-benchmarks/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-10 05:18:39,916 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/data/fe4b9c1a1/41c0e2fb44e2467a96ac523015abee3b/FLAGa6c356805 [2018-11-10 05:18:39,924 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/data/fe4b9c1a1/41c0e2fb44e2467a96ac523015abee3b [2018-11-10 05:18:39,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:18:39,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:18:39,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:18:39,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:18:39,930 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:18:39,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:18:39" (1/1) ... [2018-11-10 05:18:39,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5adf90f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:39, skipping insertion in model container [2018-11-10 05:18:39,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:18:39" (1/1) ... [2018-11-10 05:18:39,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:18:39,952 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:18:40,048 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:18:40,050 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:18:40,062 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:18:40,072 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:18:40,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40 WrapperNode [2018-11-10 05:18:40,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:18:40,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:18:40,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:18:40,073 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:18:40,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:18:40,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:18:40,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:18:40,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:18:40,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... [2018-11-10 05:18:40,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:18:40,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:18:40,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:18:40,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:18:40,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2018-11-10 05:18:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2018-11-10 05:18:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-11-10 05:18:40,184 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-11-10 05:18:40,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:18:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:18:40,185 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2018-11-10 05:18:40,185 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2018-11-10 05:18:40,365 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:18:40,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:18:40 BoogieIcfgContainer [2018-11-10 05:18:40,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:18:40,366 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 05:18:40,366 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 05:18:40,371 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 05:18:40,372 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:18:40,372 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 05:18:39" (1/3) ... [2018-11-10 05:18:40,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c89664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:18:40, skipping insertion in model container [2018-11-10 05:18:40,373 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:18:40,373 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:18:40" (2/3) ... [2018-11-10 05:18:40,373 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19c89664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 05:18:40, skipping insertion in model container [2018-11-10 05:18:40,374 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 05:18:40,374 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:18:40" (3/3) ... [2018-11-10 05:18:40,375 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2018-11-10 05:18:40,424 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:18:40,424 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 05:18:40,424 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 05:18:40,424 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 05:18:40,425 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:18:40,425 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:18:40,425 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 05:18:40,425 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:18:40,425 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 05:18:40,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-10 05:18:40,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:18:40,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:40,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:40,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:18:40,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:40,472 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 05:18:40,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states. [2018-11-10 05:18:40,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:18:40,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:40,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:40,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:18:40,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:40,483 INFO L793 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 14#L76true assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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-10 05:18:40,484 INFO L795 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 42#L56true assume !(~n <= 1); 36#L59true assume !(~n == 2); 26#L62true assume ~n > 2; 40#L63true assume !(~m <= 1); 33#L66true call #t~ret6 := multiple_of(~n, ~m);< 52#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 32#L30true assume !(~m < 0); 25#L33true assume !(~n < 0); 38#L36true assume ~m == 0;#res := 0; 28#multiple_ofFINALtrue assume true; 47#multiple_ofEXITtrue >#122#return; 31#L66-1true assume !(#t~ret6 == 0);havoc #t~ret6; 24#L69true call #t~ret7 := is_prime_(~n, ~m - 1);< 12#is_prime_ENTRYtrue [2018-11-10 05:18:40,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 1 times [2018-11-10 05:18:40,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1788949215, now seen corresponding path program 1 times [2018-11-10 05:18:40,574 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:40,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:40,642 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-10 05:18:40,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:40,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:18:40,647 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:18:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:18:40,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:18:40,658 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-11-10 05:18:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:40,764 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2018-11-10 05:18:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:18:40,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 80 transitions. [2018-11-10 05:18:40,769 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:18:40,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 41 states and 54 transitions. [2018-11-10 05:18:40,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-10 05:18:40,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-10 05:18:40,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2018-11-10 05:18:40,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:18:40,778 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-10 05:18:40,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2018-11-10 05:18:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-11-10 05:18:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 05:18:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2018-11-10 05:18:40,800 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-11-10 05:18:40,800 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2018-11-10 05:18:40,800 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 05:18:40,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2018-11-10 05:18:40,801 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:18:40,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:40,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:40,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:18:40,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:40,802 INFO L793 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 145#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 134#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 142#is_prime_ENTRY [2018-11-10 05:18:40,803 INFO L795 eck$LassoCheckResult]: Loop: 142#is_prime_ENTRY ~n := #in~n;~m := #in~m; 143#L56 assume !(~n <= 1); 133#L59 assume !(~n == 2); 137#L62 assume ~n > 2; 146#L63 assume !(~m <= 1); 122#L66 call #t~ret6 := multiple_of(~n, ~m);< 130#multiple_ofENTRY ~n := #in~n;~m := #in~m; 156#L30 assume !(~m < 0); 152#L33 assume !(~n < 0); 140#L36 assume !(~m == 0); 141#L39 assume ~n == 0;#res := 1; 124#multiple_ofFINAL assume true; 153#multiple_ofEXIT >#122#return; 154#L66-1 assume !(#t~ret6 == 0);havoc #t~ret6; 135#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 142#is_prime_ENTRY [2018-11-10 05:18:40,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 2 times [2018-11-10 05:18:40,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,811 INFO L82 PathProgramCache]: Analyzing trace with hash 399153633, now seen corresponding path program 1 times [2018-11-10 05:18:40,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:40,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:40,860 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-10 05:18:40,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:40,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:18:40,861 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 05:18:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:18:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:18:40,862 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-10 05:18:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:40,910 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2018-11-10 05:18:40,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:18:40,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. [2018-11-10 05:18:40,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:18:40,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 57 transitions. [2018-11-10 05:18:40,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 05:18:40,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-10 05:18:40,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2018-11-10 05:18:40,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 05:18:40,914 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2018-11-10 05:18:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2018-11-10 05:18:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-10 05:18:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-10 05:18:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2018-11-10 05:18:40,917 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-10 05:18:40,917 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2018-11-10 05:18:40,917 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 05:18:40,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2018-11-10 05:18:40,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2018-11-10 05:18:40,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:40,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:40,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 05:18:40,918 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-10 05:18:40,919 INFO L793 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 236#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 237#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 226#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 234#is_prime_ENTRY [2018-11-10 05:18:40,919 INFO L795 eck$LassoCheckResult]: Loop: 234#is_prime_ENTRY ~n := #in~n;~m := #in~m; 235#L56 assume !(~n <= 1); 225#L59 assume !(~n == 2); 229#L62 assume ~n > 2; 238#L63 assume !(~m <= 1); 214#L66 call #t~ret6 := multiple_of(~n, ~m);< 222#multiple_ofENTRY ~n := #in~n;~m := #in~m; 250#L30 assume !(~m < 0); 245#L33 assume !(~n < 0); 232#L36 assume !(~m == 0); 233#L39 assume !(~n == 0); 215#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 222#multiple_ofENTRY ~n := #in~n;~m := #in~m; 250#L30 assume !(~m < 0); 245#L33 assume !(~n < 0); 232#L36 assume !(~m == 0); 233#L39 assume ~n == 0;#res := 1; 216#multiple_ofFINAL assume true; 246#multiple_ofEXIT >#112#return; 239#L42-1 #res := #t~ret4;havoc #t~ret4; 240#multiple_ofFINAL assume true; 247#multiple_ofEXIT >#122#return; 249#L66-1 assume !(#t~ret6 == 0);havoc #t~ret6; 227#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 234#is_prime_ENTRY [2018-11-10 05:18:40,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2218663, now seen corresponding path program 3 times [2018-11-10 05:18:40,919 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1840266607, now seen corresponding path program 1 times [2018-11-10 05:18:40,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:40,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:40,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:40,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1482001207, now seen corresponding path program 1 times [2018-11-10 05:18:40,946 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:40,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:40,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:40,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:41,030 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-10 05:18:41,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:18:41,030 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:41,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:41,101 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-10 05:18:41,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:18:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 05:18:41,312 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:41,312 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:41,313 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:41,313 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:41,313 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:41,313 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:41,313 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:41,313 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:41,313 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-10 05:18:41,313 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:41,314 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:41,324 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-10 05:18:41,327 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-10 05:18:41,329 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-10 05:18:41,330 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-10 05:18:41,331 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-10 05:18:41,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-10 05:18:41,375 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:41,375 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:41,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:41,398 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:41,398 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,416 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:41,416 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:41,418 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:41,418 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:41,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:41,438 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:41,438 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:41,454 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:41,456 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:41,456 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:41,481 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:41,514 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:41,514 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:41,552 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:41,553 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:41,553 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:41,553 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:41,553 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:41,554 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:41,554 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:41,554 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:41,554 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:41,554 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2018-11-10 05:18:41,554 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:41,554 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:41,555 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-10 05:18:41,572 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-10 05:18:41,574 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-10 05:18:41,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-10 05:18:41,585 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-10 05:18:41,586 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-10 05:18:41,651 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:41,654 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:41,655 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-10 05:18:41,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:41,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:41,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:41,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:41,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:41,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:41,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:41,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:41,660 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-10 05:18:41,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:41,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:41,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:41,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:41,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:41,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:41,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:41,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:41,663 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-10 05:18:41,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:41,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:41,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:41,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:41,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:41,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:41,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:41,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:41,666 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-10 05:18:41,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:41,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:41,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:41,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:41,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:41,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:41,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:41,671 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:41,676 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 05:18:41,677 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 05:18:41,678 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:41,678 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:41,678 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:41,678 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2018-11-10 05:18:41,679 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:41,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:41,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:41,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:41,833 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-10 05:18:41,835 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-10 05:18:41,836 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-10 05:18:42,087 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 175 states and 239 transitions. Complement of second has 40 states. [2018-11-10 05:18:42,088 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-10 05:18:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 05:18:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2018-11-10 05:18:42,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2018-11-10 05:18:42,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:42,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 28 letters. Loop has 24 letters. [2018-11-10 05:18:42,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:42,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 4 letters. Loop has 48 letters. [2018-11-10 05:18:42,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:42,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 239 transitions. [2018-11-10 05:18:42,098 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2018-11-10 05:18:42,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 151 states and 201 transitions. [2018-11-10 05:18:42,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 05:18:42,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-10 05:18:42,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 201 transitions. [2018-11-10 05:18:42,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:42,102 INFO L705 BuchiCegarLoop]: Abstraction has 151 states and 201 transitions. [2018-11-10 05:18:42,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 201 transitions. [2018-11-10 05:18:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 108. [2018-11-10 05:18:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 05:18:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2018-11-10 05:18:42,110 INFO L728 BuchiCegarLoop]: Abstraction has 108 states and 139 transitions. [2018-11-10 05:18:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:18:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:18:42,111 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand 9 states. [2018-11-10 05:18:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:42,245 INFO L93 Difference]: Finished difference Result 146 states and 193 transitions. [2018-11-10 05:18:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:18:42,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 193 transitions. [2018-11-10 05:18:42,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 05:18:42,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 140 states and 185 transitions. [2018-11-10 05:18:42,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-10 05:18:42,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 05:18:42,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 185 transitions. [2018-11-10 05:18:42,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:42,253 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 185 transitions. [2018-11-10 05:18:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 185 transitions. [2018-11-10 05:18:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2018-11-10 05:18:42,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-10 05:18:42,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2018-11-10 05:18:42,263 INFO L728 BuchiCegarLoop]: Abstraction has 112 states and 145 transitions. [2018-11-10 05:18:42,263 INFO L608 BuchiCegarLoop]: Abstraction has 112 states and 145 transitions. [2018-11-10 05:18:42,263 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 05:18:42,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 145 transitions. [2018-11-10 05:18:42,264 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-11-10 05:18:42,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:42,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:42,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:42,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:18:42,265 INFO L793 eck$LassoCheckResult]: Stem: 1001#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 980#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 981#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 959#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 975#is_prime_ENTRY ~n := #in~n;~m := #in~m; 977#L56 assume !(~n <= 1); 958#L59 assume !(~n == 2); 961#L62 assume ~n > 2; 982#L63 assume !(~m <= 1); 950#L66 call #t~ret6 := multiple_of(~n, ~m);< 1009#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1036#L30 assume ~m < 0; 969#L31 [2018-11-10 05:18:42,265 INFO L795 eck$LassoCheckResult]: Loop: 969#L31 call #t~ret2 := multiple_of(~n, -~m);< 988#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1006#L30 assume ~m < 0; 969#L31 [2018-11-10 05:18:42,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash -123397399, now seen corresponding path program 1 times [2018-11-10 05:18:42,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:42,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:42,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:42,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:42,290 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-10 05:18:42,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:18:42,291 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:42,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:42,291 INFO L82 PathProgramCache]: Analyzing trace with hash 132621, now seen corresponding path program 1 times [2018-11-10 05:18:42,292 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:42,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:42,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:42,321 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:42,321 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:42,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:42,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:42,322 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:42,322 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:42,322 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:42,322 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:42,322 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-10 05:18:42,322 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:42,322 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:42,323 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-10 05:18:42,325 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-10 05:18:42,329 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-10 05:18:42,330 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-10 05:18:42,331 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-10 05:18:42,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-10 05:18:42,381 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:42,381 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:42,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:42,382 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:42,385 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:42,385 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:42,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:42,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:42,404 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:42,404 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0, multiple_of_#in~n=0} Honda state: {multiple_of_~n=0, multiple_of_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:42,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:42,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:42,421 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:42,422 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:42,441 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:42,442 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:42,443 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:42,443 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:42,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:42,460 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:42,479 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:42,479 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,493 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:43,495 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:43,495 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:43,495 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:43,495 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:43,495 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:43,495 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:43,495 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:43,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:43,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2018-11-10 05:18:43,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:43,495 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:43,496 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-10 05:18:43,497 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-10 05:18:43,504 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-10 05:18:43,505 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-10 05:18:43,506 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-10 05:18:43,509 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-10 05:18:43,530 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:43,530 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:43,530 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-10 05:18:43,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,532 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-10 05:18:43,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,534 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-10 05:18:43,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,535 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-10 05:18:43,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,536 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-10 05:18:43,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,539 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:43,540 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:18:43,540 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:18:43,541 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:43,541 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:43,541 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:43,541 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2018-11-10 05:18:43,541 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:43,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:43,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:43,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:43,576 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-10 05:18:43,576 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-10 05:18:43,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 145 transitions. cyclomatic complexity: 37 Second operand 4 states. [2018-11-10 05:18:43,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 145 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 210 states and 272 transitions. Complement of second has 18 states. [2018-11-10 05:18:43,621 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-10 05:18:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:18:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2018-11-10 05:18:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-10 05:18:43,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 15 letters. Loop has 3 letters. [2018-11-10 05:18:43,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 6 letters. [2018-11-10 05:18:43,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:43,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 272 transitions. [2018-11-10 05:18:43,626 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2018-11-10 05:18:43,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 156 states and 201 transitions. [2018-11-10 05:18:43,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2018-11-10 05:18:43,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2018-11-10 05:18:43,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 201 transitions. [2018-11-10 05:18:43,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:43,630 INFO L705 BuchiCegarLoop]: Abstraction has 156 states and 201 transitions. [2018-11-10 05:18:43,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 201 transitions. [2018-11-10 05:18:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 127. [2018-11-10 05:18:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 05:18:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 165 transitions. [2018-11-10 05:18:43,638 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 165 transitions. [2018-11-10 05:18:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:18:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:18:43,639 INFO L87 Difference]: Start difference. First operand 127 states and 165 transitions. Second operand 5 states. [2018-11-10 05:18:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:43,669 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2018-11-10 05:18:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:18:43,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2018-11-10 05:18:43,670 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 05:18:43,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 115 states and 145 transitions. [2018-11-10 05:18:43,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-10 05:18:43,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-11-10 05:18:43,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 145 transitions. [2018-11-10 05:18:43,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:43,673 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 145 transitions. [2018-11-10 05:18:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 145 transitions. [2018-11-10 05:18:43,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-11-10 05:18:43,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 05:18:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2018-11-10 05:18:43,681 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2018-11-10 05:18:43,681 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2018-11-10 05:18:43,681 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 05:18:43,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 141 transitions. [2018-11-10 05:18:43,683 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 05:18:43,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:43,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:43,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:43,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:18:43,684 INFO L793 eck$LassoCheckResult]: Stem: 1650#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1627#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 1628#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 1611#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1622#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1624#L56 assume ~n <= 1;#res := 0; 1684#is_prime_FINAL assume true; 1660#is_prime_EXIT >#118#return; 1614#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1604#L51-2 main_#t~ret9 := is_prime_#res;assume { :end_inline_is_prime } true;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 1605#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1640#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := main_~result~0 == 1; 1641#L95 assume main_#t~short13; 1596#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1613#multENTRY [2018-11-10 05:18:43,684 INFO L795 eck$LassoCheckResult]: Loop: 1613#multENTRY ~n := #in~n;~m := #in~m; 1594#L16 assume ~m < 0; 1597#L17 call #t~ret0 := mult(~n, -~m);< 1613#multENTRY [2018-11-10 05:18:43,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash 636635474, now seen corresponding path program 1 times [2018-11-10 05:18:43,684 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:43,728 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-10 05:18:43,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:43,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 05:18:43,729 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:43,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 53805, now seen corresponding path program 1 times [2018-11-10 05:18:43,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:43,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:43,760 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:43,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:43,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:43,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:43,760 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:43,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:43,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:43,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:43,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-10 05:18:43,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:43,761 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:43,762 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-10 05:18:43,764 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-10 05:18:43,765 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-10 05:18:43,766 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-10 05:18:43,767 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-10 05:18:43,769 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-10 05:18:43,770 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-10 05:18:43,797 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:43,797 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,804 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,804 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,811 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:43,812 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,831 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:43,831 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,851 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:43,851 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,867 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,867 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,869 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:43,869 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,888 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:43,888 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,904 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:43,906 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:43,922 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:43,940 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:43,940 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:43,960 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:43,961 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:43,961 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:43,961 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:43,961 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:43,961 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:43,961 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:43,961 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:43,961 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:43,961 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2018-11-10 05:18:43,962 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:43,962 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:43,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-10 05:18:43,968 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-10 05:18:43,969 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-10 05:18:43,969 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-10 05:18:43,971 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-10 05:18:43,972 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-10 05:18:43,973 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-10 05:18:43,990 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:43,990 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:43,991 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-10 05:18:43,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,992 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-10 05:18:43,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,993 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,994 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-10 05:18:43,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,996 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-10 05:18:43,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:43,998 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-10 05:18:43,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:43,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:43,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:43,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:43,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:43,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:43,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:43,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:44,000 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-10 05:18:44,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:44,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:44,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:44,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:44,002 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-10 05:18:44,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:44,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:44,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:44,005 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:44,006 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:18:44,006 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:18:44,007 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:44,007 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:44,007 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:44,007 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2018-11-10 05:18:44,007 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:44,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,091 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-10 05:18:44,091 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-10 05:18:44,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 141 transitions. cyclomatic complexity: 34 Second operand 5 states. [2018-11-10 05:18:44,169 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 141 transitions. cyclomatic complexity: 34. Second operand 5 states. Result 143 states and 177 transitions. Complement of second has 14 states. [2018-11-10 05:18:44,170 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-10 05:18:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:18:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2018-11-10 05:18:44,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-10 05:18:44,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-10 05:18:44,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-10 05:18:44,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 177 transitions. [2018-11-10 05:18:44,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 05:18:44,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 135 states and 169 transitions. [2018-11-10 05:18:44,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 05:18:44,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2018-11-10 05:18:44,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 169 transitions. [2018-11-10 05:18:44,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:44,175 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 169 transitions. [2018-11-10 05:18:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 169 transitions. [2018-11-10 05:18:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2018-11-10 05:18:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-10 05:18:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2018-11-10 05:18:44,181 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 155 transitions. [2018-11-10 05:18:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:18:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:18:44,181 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand 7 states. [2018-11-10 05:18:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:44,216 INFO L93 Difference]: Finished difference Result 131 states and 164 transitions. [2018-11-10 05:18:44,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:18:44,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 164 transitions. [2018-11-10 05:18:44,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 05:18:44,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 123 states and 155 transitions. [2018-11-10 05:18:44,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 05:18:44,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-10 05:18:44,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 155 transitions. [2018-11-10 05:18:44,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:44,219 INFO L705 BuchiCegarLoop]: Abstraction has 123 states and 155 transitions. [2018-11-10 05:18:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 155 transitions. [2018-11-10 05:18:44,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-11-10 05:18:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-10 05:18:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2018-11-10 05:18:44,227 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 152 transitions. [2018-11-10 05:18:44,227 INFO L608 BuchiCegarLoop]: Abstraction has 121 states and 152 transitions. [2018-11-10 05:18:44,227 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 05:18:44,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 152 transitions. [2018-11-10 05:18:44,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 05:18:44,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:44,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:44,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 05:18:44,229 INFO L793 eck$LassoCheckResult]: Stem: 2255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 2231#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 2213#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2223#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2225#L56 assume !(~n <= 1); 2268#L59 assume !(~n == 2); 2254#L62 assume ~n > 2; 2232#L63 assume !(~m <= 1); 2201#L66 call #t~ret6 := multiple_of(~n, ~m);< 2260#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2279#L30 assume !(~m < 0); 2278#L33 assume ~n < 0; 2189#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2203#multiple_ofENTRY [2018-11-10 05:18:44,229 INFO L795 eck$LassoCheckResult]: Loop: 2203#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2258#L30 assume !(~m < 0); 2247#L33 assume ~n < 0; 2190#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2203#multiple_ofENTRY [2018-11-10 05:18:44,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1674187120, now seen corresponding path program 1 times [2018-11-10 05:18:44,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:44,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,263 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-10 05:18:44,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:44,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 05:18:44,263 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:44,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash 929675, now seen corresponding path program 1 times [2018-11-10 05:18:44,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,314 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:44,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:44,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:44,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:44,314 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:44,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:44,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:44,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:44,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-10 05:18:44,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:44,315 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:44,315 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-10 05:18:44,317 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-10 05:18:44,318 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-10 05:18:44,319 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-10 05:18:44,322 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-10 05:18:44,323 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-10 05:18:44,325 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-10 05:18:44,327 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-10 05:18:44,354 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:44,354 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:44,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:44,364 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:44,364 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,380 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:44,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:44,382 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:44,382 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,398 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:44,398 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:44,400 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:44,400 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:44,417 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,435 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:44,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:44,456 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:44,457 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:44,457 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:44,458 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:44,458 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:44,458 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:44,458 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:44,458 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:44,458 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:44,458 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2018-11-10 05:18:44,458 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:44,458 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:44,459 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-10 05:18:44,461 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-10 05:18:44,462 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-10 05:18:44,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-10 05:18:44,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-10 05:18:44,467 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-10 05:18:44,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-10 05:18:44,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-10 05:18:44,488 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:44,488 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:44,489 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-10 05:18:44,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:44,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:44,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:44,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:44,490 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-10 05:18:44,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:44,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:44,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:44,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:44,492 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-10 05:18:44,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:44,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:44,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:44,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:44,494 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-10 05:18:44,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:44,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:44,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:44,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:44,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:44,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:44,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:44,497 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:44,498 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:18:44,498 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:18:44,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:44,498 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:44,499 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:44,499 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2018-11-10 05:18:44,499 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:44,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:44,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:44,546 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-10 05:18:44,546 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-10 05:18:44,546 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 152 transitions. cyclomatic complexity: 36 Second operand 4 states. [2018-11-10 05:18:44,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 152 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 271 states and 353 transitions. Complement of second has 13 states. [2018-11-10 05:18:44,591 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-10 05:18:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 05:18:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-10 05:18:44,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-10 05:18:44,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2018-11-10 05:18:44,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-10 05:18:44,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:44,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 353 transitions. [2018-11-10 05:18:44,596 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-10 05:18:44,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 247 states and 329 transitions. [2018-11-10 05:18:44,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2018-11-10 05:18:44,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2018-11-10 05:18:44,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 329 transitions. [2018-11-10 05:18:44,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:44,600 INFO L705 BuchiCegarLoop]: Abstraction has 247 states and 329 transitions. [2018-11-10 05:18:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 329 transitions. [2018-11-10 05:18:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-11-10 05:18:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 05:18:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2018-11-10 05:18:44,610 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 284 transitions. [2018-11-10 05:18:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:18:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:18:44,610 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand 7 states. [2018-11-10 05:18:44,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:44,673 INFO L93 Difference]: Finished difference Result 221 states and 288 transitions. [2018-11-10 05:18:44,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:18:44,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 288 transitions. [2018-11-10 05:18:44,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:18:44,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 221 states and 288 transitions. [2018-11-10 05:18:44,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-11-10 05:18:44,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-11-10 05:18:44,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 288 transitions. [2018-11-10 05:18:44,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:44,678 INFO L705 BuchiCegarLoop]: Abstraction has 221 states and 288 transitions. [2018-11-10 05:18:44,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 288 transitions. [2018-11-10 05:18:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2018-11-10 05:18:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 05:18:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 283 transitions. [2018-11-10 05:18:44,688 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 283 transitions. [2018-11-10 05:18:44,688 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 283 transitions. [2018-11-10 05:18:44,688 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 05:18:44,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 283 transitions. [2018-11-10 05:18:44,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:18:44,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:44,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:44,690 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,690 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:18:44,690 INFO L793 eck$LassoCheckResult]: Stem: 3193#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3162#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 3139#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3152#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3154#L56 assume !(~n <= 1); 3138#L59 assume !(~n == 2); 3141#L62 assume ~n > 2; 3163#L63 assume !(~m <= 1); 3164#L66 call #t~ret6 := multiple_of(~n, ~m);< 3198#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3196#L30 assume !(~m < 0); 3183#L33 assume !(~n < 0); 3185#L36 assume !(~m == 0); 3244#L39 assume !(~n == 0); 3114#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3226#multiple_ofENTRY [2018-11-10 05:18:44,690 INFO L795 eck$LassoCheckResult]: Loop: 3226#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3225#L30 assume !(~m < 0); 3220#L33 assume !(~n < 0); 3148#L36 assume !(~m == 0); 3149#L39 assume !(~n == 0); 3118#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3226#multiple_ofENTRY [2018-11-10 05:18:44,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1718912949, now seen corresponding path program 1 times [2018-11-10 05:18:44,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:44,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 893418406, now seen corresponding path program 1 times [2018-11-10 05:18:44,705 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:44,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1893667952, now seen corresponding path program 2 times [2018-11-10 05:18:44,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:44,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:44,769 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:44,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:44,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:44,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:44,769 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:44,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:44,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:44,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:44,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-10 05:18:44,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:44,770 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:44,771 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-10 05:18:44,772 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-10 05:18:44,778 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-10 05:18:44,779 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-10 05:18:44,780 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-10 05:18:44,781 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-10 05:18:44,781 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-10 05:18:44,814 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:44,814 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:44,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:44,819 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:44,819 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:44,835 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:44,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:44,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:44,950 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:44,951 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:44,951 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:44,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:44,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:44,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:44,952 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:44,952 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:44,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:44,952 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2018-11-10 05:18:44,952 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:44,952 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:44,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-10 05:18:44,954 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-10 05:18:44,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-10 05:18:44,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-10 05:18:44,963 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-10 05:18:44,964 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-10 05:18:44,965 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-10 05:18:45,002 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:45,003 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:45,003 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-10 05:18:45,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,005 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-10 05:18:45,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,007 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:45,009 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:18:45,009 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:18:45,010 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:45,010 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:45,010 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:45,010 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2018-11-10 05:18:45,010 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:45,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,077 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-10 05:18:45,077 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-10 05:18:45,077 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 217 states and 283 transitions. cyclomatic complexity: 76 Second operand 6 states. [2018-11-10 05:18:45,147 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 217 states and 283 transitions. cyclomatic complexity: 76. Second operand 6 states. Result 316 states and 417 transitions. Complement of second has 21 states. [2018-11-10 05:18:45,151 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-10 05:18:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:18:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-10 05:18:45,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-10 05:18:45,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-10 05:18:45,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 43 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-10 05:18:45,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 316 states and 417 transitions. [2018-11-10 05:18:45,156 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2018-11-10 05:18:45,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 316 states to 285 states and 369 transitions. [2018-11-10 05:18:45,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2018-11-10 05:18:45,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2018-11-10 05:18:45,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 369 transitions. [2018-11-10 05:18:45,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:45,159 INFO L705 BuchiCegarLoop]: Abstraction has 285 states and 369 transitions. [2018-11-10 05:18:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 369 transitions. [2018-11-10 05:18:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 252. [2018-11-10 05:18:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-10 05:18:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2018-11-10 05:18:45,166 INFO L728 BuchiCegarLoop]: Abstraction has 252 states and 327 transitions. [2018-11-10 05:18:45,166 INFO L608 BuchiCegarLoop]: Abstraction has 252 states and 327 transitions. [2018-11-10 05:18:45,166 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 05:18:45,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 252 states and 327 transitions. [2018-11-10 05:18:45,168 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:18:45,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:45,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:45,168 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:45,168 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 05:18:45,169 INFO L793 eck$LassoCheckResult]: Stem: 3853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3812#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 3813#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 3804#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3805#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3807#L56 assume !(~n <= 1); 3908#L59 assume ~n == 2;#res := 1; 3903#is_prime_FINAL assume true; 3869#is_prime_EXIT >#118#return; 3796#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3784#L51-2 main_#t~ret9 := is_prime_#res;assume { :end_inline_is_prime } true;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 3785#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3832#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := main_~result~0 == 1; 3833#L95 assume main_#t~short13; 3773#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3806#multENTRY ~n := #in~n;~m := #in~m; 3772#L16 assume !(~m < 0); 3775#L19 [2018-11-10 05:18:45,169 INFO L795 eck$LassoCheckResult]: Loop: 3775#L19 assume !(~m == 0); 3826#L22 assume !(~m == 1); 3793#L25 call #t~ret1 := mult(~n, ~m - 1);< 3795#multENTRY ~n := #in~n;~m := #in~m; 3838#L16 assume !(~m < 0); 3775#L19 [2018-11-10 05:18:45,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2081524284, now seen corresponding path program 1 times [2018-11-10 05:18:45,169 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:45,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 61272212, now seen corresponding path program 1 times [2018-11-10 05:18:45,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1269404473, now seen corresponding path program 1 times [2018-11-10 05:18:45,187 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:45,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:45,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:45,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,238 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:45,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:45,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:45,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:45,238 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:45,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:45,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:45,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:45,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-10 05:18:45,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:45,239 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:45,239 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-10 05:18:45,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-10 05:18:45,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-10 05:18:45,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-10 05:18:45,249 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-10 05:18:45,280 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:45,280 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:45,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:45,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:45,284 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:45,284 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:45,300 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:45,300 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:45,302 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:45,302 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:45,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:45,319 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:45,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:45,339 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:45,633 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:45,634 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:45,634 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:45,634 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:45,634 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:45,634 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:45,634 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:45,634 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:45,634 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:45,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2018-11-10 05:18:45,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:45,634 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:45,635 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-10 05:18:45,636 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-10 05:18:45,636 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-10 05:18:45,639 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-10 05:18:45,641 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-10 05:18:45,673 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:45,673 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:45,674 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-10 05:18:45,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,676 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-10 05:18:45,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,681 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-10 05:18:45,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,683 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-10 05:18:45,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,685 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:45,685 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-10 05:18:45,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:45,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:45,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:45,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:45,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:45,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:45,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:45,692 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:45,693 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:18:45,694 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:18:45,694 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:45,694 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:45,694 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:45,694 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-10 05:18:45,694 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:45,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:45,768 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-10 05:18:45,769 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-10 05:18:45,769 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 252 states and 327 transitions. cyclomatic complexity: 87 Second operand 6 states. [2018-11-10 05:18:45,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 252 states and 327 transitions. cyclomatic complexity: 87. Second operand 6 states. Result 276 states and 354 transitions. Complement of second has 17 states. [2018-11-10 05:18:45,862 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-10 05:18:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:18:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-10 05:18:45,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-10 05:18:45,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 22 letters. Loop has 5 letters. [2018-11-10 05:18:45,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 17 letters. Loop has 10 letters. [2018-11-10 05:18:45,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:45,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 354 transitions. [2018-11-10 05:18:45,866 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:18:45,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 275 states and 353 transitions. [2018-11-10 05:18:45,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 133 [2018-11-10 05:18:45,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2018-11-10 05:18:45,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 275 states and 353 transitions. [2018-11-10 05:18:45,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:45,869 INFO L705 BuchiCegarLoop]: Abstraction has 275 states and 353 transitions. [2018-11-10 05:18:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states and 353 transitions. [2018-11-10 05:18:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 262. [2018-11-10 05:18:45,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-10 05:18:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 339 transitions. [2018-11-10 05:18:45,878 INFO L728 BuchiCegarLoop]: Abstraction has 262 states and 339 transitions. [2018-11-10 05:18:45,878 INFO L608 BuchiCegarLoop]: Abstraction has 262 states and 339 transitions. [2018-11-10 05:18:45,878 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 05:18:45,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 262 states and 339 transitions. [2018-11-10 05:18:45,879 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:18:45,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:45,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:45,880 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, 1] [2018-11-10 05:18:45,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 05:18:45,880 INFO L793 eck$LassoCheckResult]: Stem: 4487#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4440#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 4441#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 4421#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4433#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4436#L56 assume !(~n <= 1); 4504#L59 assume ~n == 2;#res := 1; 4500#is_prime_FINAL assume true; 4499#is_prime_EXIT >#118#return; 4428#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4413#L51-2 main_#t~ret9 := is_prime_#res;assume { :end_inline_is_prime } true;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 4414#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4467#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := main_~result~0 == 1; 4468#L95 assume main_#t~short13; 4407#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4434#multENTRY ~n := #in~n;~m := #in~m; 4406#L16 assume !(~m < 0); 4408#L19 assume !(~m == 0); 4459#L22 assume !(~m == 1); 4469#L25 call #t~ret1 := mult(~n, ~m - 1);< 4654#multENTRY ~n := #in~n;~m := #in~m; 4508#L16 assume ~m < 0; 4424#L17 [2018-11-10 05:18:45,880 INFO L795 eck$LassoCheckResult]: Loop: 4424#L17 call #t~ret0 := mult(~n, -~m);< 4425#multENTRY ~n := #in~n;~m := #in~m; 4509#L16 assume ~m < 0; 4424#L17 [2018-11-10 05:18:45,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1269404470, now seen corresponding path program 1 times [2018-11-10 05:18:45,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:45,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:45,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:45,903 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-10 05:18:45,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:18:45,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:18:45,904 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:45,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash 139155, now seen corresponding path program 2 times [2018-11-10 05:18:45,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:45,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:45,957 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:45,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:45,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:45,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:45,958 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:45,958 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:45,958 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:45,958 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:45,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-10 05:18:45,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:45,958 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:45,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-10 05:18:45,964 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-10 05:18:45,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-10 05:18:45,972 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-10 05:18:45,977 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-10 05:18:46,011 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:46,011 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,014 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:46,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:46,016 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:46,016 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:46,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:46,035 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:46,036 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,061 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:46,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:46,064 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:46,064 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=-7, mult_#in~n=-7} Honda state: {mult_~n=-7, mult_#in~n=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,089 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:46,089 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,117 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:46,117 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:46,638 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:46,639 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:46,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:46,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:46,639 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:46,639 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:46,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:46,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:46,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:46,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2018-11-10 05:18:46,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:46,640 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:46,640 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-10 05:18:46,643 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-10 05:18:46,646 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-10 05:18:46,647 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-10 05:18:46,651 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-10 05:18:46,670 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:46,670 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:46,671 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-10 05:18:46,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:46,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:46,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:46,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:46,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:46,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:46,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:46,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:46,672 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-10 05:18:46,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:46,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:46,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:46,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:46,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:46,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:46,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:46,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:46,674 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-10 05:18:46,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:46,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:46,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:46,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:46,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:46,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:46,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:46,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 05:18:46,676 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-10 05:18:46,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:46,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:46,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:46,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:46,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:46,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:46,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:46,678 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:46,679 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 05:18:46,679 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 05:18:46,680 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:46,680 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:46,680 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:46,680 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2018-11-10 05:18:46,680 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:46,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:46,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:46,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:46,729 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-10 05:18:46,730 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-10 05:18:46,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 262 states and 339 transitions. cyclomatic complexity: 90 Second operand 5 states. [2018-11-10 05:18:46,772 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 262 states and 339 transitions. cyclomatic complexity: 90. Second operand 5 states. Result 303 states and 385 transitions. Complement of second has 11 states. [2018-11-10 05:18:46,775 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-10 05:18:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 05:18:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-10 05:18:46,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-10 05:18:46,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:46,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-10 05:18:46,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:46,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-10 05:18:46,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:46,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 385 transitions. [2018-11-10 05:18:46,779 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2018-11-10 05:18:46,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 293 states and 375 transitions. [2018-11-10 05:18:46,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 144 [2018-11-10 05:18:46,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 146 [2018-11-10 05:18:46,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 375 transitions. [2018-11-10 05:18:46,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:46,781 INFO L705 BuchiCegarLoop]: Abstraction has 293 states and 375 transitions. [2018-11-10 05:18:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 375 transitions. [2018-11-10 05:18:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 280. [2018-11-10 05:18:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-10 05:18:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 361 transitions. [2018-11-10 05:18:46,786 INFO L728 BuchiCegarLoop]: Abstraction has 280 states and 361 transitions. [2018-11-10 05:18:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:18:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:18:46,787 INFO L87 Difference]: Start difference. First operand 280 states and 361 transitions. Second operand 5 states. [2018-11-10 05:18:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:46,814 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2018-11-10 05:18:46,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:18:46,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 352 transitions. [2018-11-10 05:18:46,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2018-11-10 05:18:46,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 197 states and 237 transitions. [2018-11-10 05:18:46,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2018-11-10 05:18:46,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-10 05:18:46,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 237 transitions. [2018-11-10 05:18:46,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:46,817 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 237 transitions. [2018-11-10 05:18:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 237 transitions. [2018-11-10 05:18:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-11-10 05:18:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 05:18:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 210 transitions. [2018-11-10 05:18:46,821 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 210 transitions. [2018-11-10 05:18:46,821 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 210 transitions. [2018-11-10 05:18:46,821 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 05:18:46,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 210 transitions. [2018-11-10 05:18:46,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-10 05:18:46,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:46,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:46,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:46,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 05:18:46,823 INFO L793 eck$LassoCheckResult]: Stem: 5676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5673#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 5647#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5664#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5666#L56 assume !(~n <= 1); 5741#L59 assume !(~n == 2); 5740#L62 assume ~n > 2; 5739#L63 assume !(~m <= 1); 5733#L66 call #t~ret6 := multiple_of(~n, ~m);< 5738#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5737#L30 assume !(~m < 0); 5736#L33 assume !(~n < 0); 5735#L36 assume !(~m == 0); 5734#L39 assume !(~n == 0); 5690#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5732#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5731#L30 assume !(~m < 0); 5788#L33 assume ~n < 0; 5631#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5774#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5679#L30 assume !(~m < 0); 5628#L33 assume !(~n < 0); 5630#L36 [2018-11-10 05:18:46,823 INFO L795 eck$LassoCheckResult]: Loop: 5630#L36 assume !(~m == 0); 5661#L39 assume !(~n == 0); 5649#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5650#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5787#L30 assume !(~m < 0); 5786#L33 assume !(~n < 0); 5630#L36 [2018-11-10 05:18:46,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:46,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1425858095, now seen corresponding path program 1 times [2018-11-10 05:18:46,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:46,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:46,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:46,867 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-10 05:18:46,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:18:46,867 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:46,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:46,885 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-10 05:18:46,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:18:46,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 05:18:46,901 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 05:18:46,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1367347516, now seen corresponding path program 2 times [2018-11-10 05:18:46,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:46,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:46,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:46,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:46,942 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:46,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:46,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:46,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:46,942 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 05:18:46,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:46,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:46,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:46,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-10 05:18:46,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:46,943 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:46,943 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-10 05:18:46,944 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-10 05:18:46,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-10 05:18:46,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-10 05:18:46,953 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-10 05:18:46,985 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:46,985 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:46,987 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:46,987 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:46,989 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 05:18:46,989 INFO L446 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_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:47,004 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 05:18:47,004 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/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-10 05:18:47,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 05:18:47,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 05:18:48,120 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 05:18:48,121 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 05:18:48,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 05:18:48,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 05:18:48,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 05:18:48,121 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 05:18:48,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 05:18:48,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 05:18:48,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 05:18:48,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2018-11-10 05:18:48,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 05:18:48,122 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 05:18:48,122 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-10 05:18:48,130 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-10 05:18:48,131 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-10 05:18:48,132 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-10 05:18:48,133 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-10 05:18:48,164 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 05:18:48,165 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 05:18:48,165 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-10 05:18:48,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 05:18:48,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 05:18:48,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 05:18:48,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 05:18:48,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 05:18:48,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 05:18:48,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 05:18:48,168 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 05:18:48,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 05:18:48,170 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 05:18:48,170 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 05:18:48,170 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 05:18:48,170 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 05:18:48,170 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2018-11-10 05:18:48,170 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 05:18:48,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:48,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:48,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:48,261 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-10 05:18:48,261 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-10 05:18:48,261 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-10 05:18:48,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 198 states and 242 transitions. Complement of second has 15 states. [2018-11-10 05:18:48,329 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-10 05:18:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:18:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 05:18:48,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 05:18:48,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:48,330 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:18:48,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:48,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:48,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:48,388 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-10 05:18:48,388 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-10 05:18:48,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-10 05:18:48,452 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 198 states and 242 transitions. Complement of second has 15 states. [2018-11-10 05:18:48,453 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-10 05:18:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:18:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-10 05:18:48,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 05:18:48,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:48,453 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 05:18:48,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:48,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:18:48,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:18:48,517 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-10 05:18:48,517 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-10 05:18:48,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49 Second operand 6 states. [2018-11-10 05:18:48,590 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 210 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 266 states and 320 transitions. Complement of second has 16 states. [2018-11-10 05:18:48,590 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-10 05:18:48,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 05:18:48,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-10 05:18:48,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 23 letters. Loop has 6 letters. [2018-11-10 05:18:48,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:48,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 29 letters. Loop has 6 letters. [2018-11-10 05:18:48,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:48,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 37 transitions. Stem has 23 letters. Loop has 12 letters. [2018-11-10 05:18:48,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 05:18:48,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 320 transitions. [2018-11-10 05:18:48,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 05:18:48,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 224 states and 271 transitions. [2018-11-10 05:18:48,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 05:18:48,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 05:18:48,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 271 transitions. [2018-11-10 05:18:48,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:48,596 INFO L705 BuchiCegarLoop]: Abstraction has 224 states and 271 transitions. [2018-11-10 05:18:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 271 transitions. [2018-11-10 05:18:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 183. [2018-11-10 05:18:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-11-10 05:18:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2018-11-10 05:18:48,601 INFO L728 BuchiCegarLoop]: Abstraction has 183 states and 227 transitions. [2018-11-10 05:18:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:18:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:18:48,602 INFO L87 Difference]: Start difference. First operand 183 states and 227 transitions. Second operand 8 states. [2018-11-10 05:18:48,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:18:48,666 INFO L93 Difference]: Finished difference Result 244 states and 300 transitions. [2018-11-10 05:18:48,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:18:48,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 244 states and 300 transitions. [2018-11-10 05:18:48,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 05:18:48,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 244 states to 234 states and 290 transitions. [2018-11-10 05:18:48,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-10 05:18:48,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 05:18:48,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 234 states and 290 transitions. [2018-11-10 05:18:48,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 05:18:48,670 INFO L705 BuchiCegarLoop]: Abstraction has 234 states and 290 transitions. [2018-11-10 05:18:48,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states and 290 transitions. [2018-11-10 05:18:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 213. [2018-11-10 05:18:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-10 05:18:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 267 transitions. [2018-11-10 05:18:48,676 INFO L728 BuchiCegarLoop]: Abstraction has 213 states and 267 transitions. [2018-11-10 05:18:48,676 INFO L608 BuchiCegarLoop]: Abstraction has 213 states and 267 transitions. [2018-11-10 05:18:48,676 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 05:18:48,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 213 states and 267 transitions. [2018-11-10 05:18:48,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 05:18:48,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 05:18:48,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 05:18:48,677 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:48,677 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 05:18:48,677 INFO L793 eck$LassoCheckResult]: Stem: 7370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 7363#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);assume { :begin_inline_is_prime } true;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; 7328#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7352#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7354#L56 assume !(~n <= 1); 7341#L59 assume !(~n == 2); 7342#L62 assume ~n > 2; 7367#L63 assume !(~m <= 1); 7316#L66 call #t~ret6 := multiple_of(~n, ~m);< 7381#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7382#L30 assume !(~m < 0); 7315#L33 assume !(~n < 0); 7317#L36 assume !(~m == 0); 7429#L39 assume !(~n == 0); 7365#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7387#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7431#L30 assume !(~m < 0); 7430#L33 assume !(~n < 0); 7428#L36 assume !(~m == 0); 7364#L39 assume !(~n == 0); 7337#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7386#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7416#L30 assume !(~m < 0); 7413#L33 assume ~n < 0; 7336#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7338#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7420#L30 assume !(~m < 0); 7424#L33 assume !(~n < 0); 7410#L36 [2018-11-10 05:18:48,677 INFO L795 eck$LassoCheckResult]: Loop: 7410#L36 assume !(~m == 0); 7421#L39 assume !(~n == 0); 7394#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7417#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7414#L30 assume !(~m < 0); 7393#L33 assume ~n < 0; 7395#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7412#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7411#L30 assume !(~m < 0); 7409#L33 assume !(~n < 0); 7410#L36 [2018-11-10 05:18:48,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:48,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1154252276, now seen corresponding path program 2 times [2018-11-10 05:18:48,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:48,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:48,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:48,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2073798158, now seen corresponding path program 1 times [2018-11-10 05:18:48,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:48,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:48,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 05:18:48,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:48,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:18:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1536095683, now seen corresponding path program 3 times [2018-11-10 05:18:48,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 05:18:48,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 05:18:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:48,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:18:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:18:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:18:49,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 05:18:49 BoogieIcfgContainer [2018-11-10 05:18:49,089 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 05:18:49,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:18:49,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:18:49,090 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:18:49,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:18:40" (3/4) ... [2018-11-10 05:18:49,092 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 05:18:49,120 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fe1b2b1d-90ff-4b9a-9c4d-f57d3545c48d/bin-2019/uautomizer/witness.graphml [2018-11-10 05:18:49,120 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:18:49,121 INFO L168 Benchmark]: Toolchain (without parser) took 9194.86 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.9 MB). Free memory was 962.4 MB in the beginning and 1.2 GB in the end (delta: -251.4 MB). Peak memory consumption was 81.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:49,122 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:18:49,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.21 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:49,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:49,123 INFO L168 Benchmark]: Boogie Preprocessor took 13.27 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:18:49,123 INFO L168 Benchmark]: RCFGBuilder took 256.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:49,124 INFO L168 Benchmark]: BuchiAutomizer took 8723.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.9 MB). Peak memory consumption was 455.5 MB. Max. memory is 11.5 GB. [2018-11-10 05:18:49,124 INFO L168 Benchmark]: Witness Printer took 31.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 967.9 kB). Peak memory consumption was 967.9 kB. Max. memory is 11.5 GB. [2018-11-10 05:18:49,126 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.21 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.27 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 256.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8723.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.9 MB). Peak memory consumption was 455.5 MB. Max. memory is 11.5 GB. * Witness Printer took 31.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 967.9 kB). Peak memory consumption was 967.9 kB. 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 213 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 6.2s. Construction of modules took 0.5s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 304 StatesRemovedByMinimization, 16 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 262 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 711 SDtfs, 715 SDslu, 1175 SDs, 0 SdLazy, 884 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s 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: 4ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 3.4s - 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@20d7dabe=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@73217941=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@611c47bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a9a0a8c=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cffeb99=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@105151f9=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1d5516d4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2693dbc=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e2b4584=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@14002800=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7b986d23=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@45932e94=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) [L81] CALL is_prime(n) [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...