./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-2e94e6a [2019-01-01 23:53:27,755 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 23:53:27,756 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 23:53:27,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 23:53:27,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 23:53:27,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 23:53:27,775 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 23:53:27,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 23:53:27,778 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 23:53:27,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 23:53:27,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 23:53:27,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 23:53:27,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 23:53:27,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 23:53:27,783 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 23:53:27,784 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 23:53:27,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 23:53:27,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 23:53:27,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 23:53:27,790 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 23:53:27,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 23:53:27,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 23:53:27,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 23:53:27,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 23:53:27,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 23:53:27,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 23:53:27,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 23:53:27,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 23:53:27,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 23:53:27,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 23:53:27,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 23:53:27,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 23:53:27,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 23:53:27,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 23:53:27,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 23:53:27,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 23:53:27,805 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 23:53:27,824 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 23:53:27,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 23:53:27,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 23:53:27,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 23:53:27,826 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 23:53:27,826 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 23:53:27,826 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 23:53:27,826 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 23:53:27,827 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 23:53:27,827 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 23:53:27,827 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 23:53:27,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 23:53:27,827 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 23:53:27,827 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 23:53:27,828 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 23:53:27,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 23:53:27,828 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 23:53:27,828 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 23:53:27,828 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 23:53:27,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 23:53:27,829 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 23:53:27,829 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 23:53:27,829 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 23:53:27,829 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 23:53:27,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 23:53:27,830 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 23:53:27,830 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 23:53:27,830 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 23:53:27,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 23:53:27,831 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 23:53:27,831 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 23:53:27,832 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 23:53:27,832 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-01 23:53:27,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 23:53:27,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 23:53:27,895 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 23:53:27,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 23:53:27,897 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 23:53:27,898 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2019-01-01 23:53:27,966 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47bde88f/5340e997234b4c5ba88aac3cdfcd4084/FLAG07a3fc22c [2019-01-01 23:53:28,432 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 23:53:28,432 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive/Primes_true-unreach-call_true-no-overflow_false-termination.c [2019-01-01 23:53:28,440 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47bde88f/5340e997234b4c5ba88aac3cdfcd4084/FLAG07a3fc22c [2019-01-01 23:53:28,782 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47bde88f/5340e997234b4c5ba88aac3cdfcd4084 [2019-01-01 23:53:28,787 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 23:53:28,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 23:53:28,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:28,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 23:53:28,799 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 23:53:28,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:28" (1/1) ... [2019-01-01 23:53:28,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3026fc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:28, skipping insertion in model container [2019-01-01 23:53:28,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 11:53:28" (1/1) ... [2019-01-01 23:53:28,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 23:53:28,837 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 23:53:29,065 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:29,076 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 23:53:29,111 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 23:53:29,140 INFO L195 MainTranslator]: Completed translation [2019-01-01 23:53:29,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29 WrapperNode [2019-01-01 23:53:29,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 23:53:29,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:29,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 23:53:29,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 23:53:29,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 23:53:29,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 23:53:29,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 23:53:29,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 23:53:29,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... [2019-01-01 23:53:29,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 23:53:29,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 23:53:29,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 23:53:29,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 23:53:29,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:29,360 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2019-01-01 23:53:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2019-01-01 23:53:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2019-01-01 23:53:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2019-01-01 23:53:29,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 23:53:29,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 23:53:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2019-01-01 23:53:29,362 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2019-01-01 23:53:29,971 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 23:53:29,971 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 23:53:29,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:29 BoogieIcfgContainer [2019-01-01 23:53:29,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 23:53:29,973 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 23:53:29,973 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 23:53:29,977 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 23:53:29,978 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:29,978 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 11:53:28" (1/3) ... [2019-01-01 23:53:29,979 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10c0c61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:29, skipping insertion in model container [2019-01-01 23:53:29,979 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:29,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 11:53:29" (2/3) ... [2019-01-01 23:53:29,980 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10c0c61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 11:53:29, skipping insertion in model container [2019-01-01 23:53:29,980 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 23:53:29,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:29" (3/3) ... [2019-01-01 23:53:29,982 INFO L375 chiAutomizerObserver]: Analyzing ICFG Primes_true-unreach-call_true-no-overflow_false-termination.c [2019-01-01 23:53:30,046 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 23:53:30,047 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 23:53:30,047 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 23:53:30,047 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 23:53:30,048 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 23:53:30,048 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 23:53:30,048 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 23:53:30,048 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 23:53:30,048 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 23:53:30,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2019-01-01 23:53:30,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 23:53:30,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:30,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:30,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:53:30,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:30,111 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 23:53:30,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states. [2019-01-01 23:53:30,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 23:53:30,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:30,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:30,118 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:53:30,118 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:30,126 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 13#L76true assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 10#L51true call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 12#is_prime_ENTRYtrue [2019-01-01 23:53:30,127 INFO L796 eck$LassoCheckResult]: Loop: 12#is_prime_ENTRYtrue ~n := #in~n;~m := #in~m; 41#L56true assume !(~n <= 1); 35#L59true assume !(2 == ~n); 25#L62true assume ~n > 2; 39#L63true assume !(~m <= 1); 32#L66true call #t~ret6 := multiple_of(~n, ~m);< 51#multiple_ofENTRYtrue ~n := #in~n;~m := #in~m; 31#L30true assume !(~m < 0); 24#L33true assume !(~n < 0); 37#L36true assume 0 == ~m;#res := 0; 27#multiple_ofFINALtrue assume true; 46#multiple_ofEXITtrue >#121#return; 30#L66-1true assume !(0 == #t~ret6);havoc #t~ret6; 23#L69true call #t~ret7 := is_prime_(~n, ~m - 1);< 12#is_prime_ENTRYtrue [2019-01-01 23:53:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,133 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 1 times [2019-01-01 23:53:30,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:30,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1613119264, now seen corresponding path program 1 times [2019-01-01 23:53:30,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:30,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:30,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:30,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:53:30,402 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:53:30,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:30,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:30,420 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2019-01-01 23:53:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:30,782 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2019-01-01 23:53:30,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:53:30,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 79 transitions. [2019-01-01 23:53:30,796 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 23:53:30,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 53 transitions. [2019-01-01 23:53:30,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 23:53:30,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-01-01 23:53:30,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2019-01-01 23:53:30,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:30,812 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-01-01 23:53:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2019-01-01 23:53:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-01 23:53:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 23:53:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-01-01 23:53:30,853 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-01-01 23:53:30,853 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-01-01 23:53:30,853 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 23:53:30,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-01-01 23:53:30,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 23:53:30,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:30,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:30,856 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:53:30,856 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:30,857 INFO L794 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 143#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 132#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 140#is_prime_ENTRY [2019-01-01 23:53:30,857 INFO L796 eck$LassoCheckResult]: Loop: 140#is_prime_ENTRY ~n := #in~n;~m := #in~m; 141#L56 assume !(~n <= 1); 131#L59 assume !(2 == ~n); 135#L62 assume ~n > 2; 142#L63 assume !(~m <= 1); 118#L66 call #t~ret6 := multiple_of(~n, ~m);< 128#multiple_ofENTRY ~n := #in~n;~m := #in~m; 153#L30 assume !(~m < 0); 149#L33 assume !(~n < 0); 138#L36 assume !(0 == ~m); 139#L39 assume 0 == ~n;#res := 1; 122#multiple_ofFINAL assume true; 150#multiple_ofEXIT >#121#return; 151#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 133#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 140#is_prime_ENTRY [2019-01-01 23:53:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 2 times [2019-01-01 23:53:30,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:30,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1554944608, now seen corresponding path program 1 times [2019-01-01 23:53:30,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:30,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:30,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:30,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 23:53:30,960 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 23:53:30,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:30,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:30,963 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-01-01 23:53:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:31,169 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-01-01 23:53:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:53:31,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-01-01 23:53:31,175 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 23:53:31,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 56 transitions. [2019-01-01 23:53:31,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-01-01 23:53:31,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 23:53:31,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 56 transitions. [2019-01-01 23:53:31,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 23:53:31,179 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-01-01 23:53:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 56 transitions. [2019-01-01 23:53:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-01-01 23:53:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 23:53:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-01-01 23:53:31,186 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-01-01 23:53:31,186 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-01-01 23:53:31,186 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 23:53:31,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2019-01-01 23:53:31,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2019-01-01 23:53:31,188 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:31,188 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:31,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 23:53:31,189 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] [2019-01-01 23:53:31,189 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 233#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 222#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 230#is_prime_ENTRY [2019-01-01 23:53:31,189 INFO L796 eck$LassoCheckResult]: Loop: 230#is_prime_ENTRY ~n := #in~n;~m := #in~m; 231#L56 assume !(~n <= 1); 221#L59 assume !(2 == ~n); 225#L62 assume ~n > 2; 232#L63 assume !(~m <= 1); 208#L66 call #t~ret6 := multiple_of(~n, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume !(0 == ~n); 209#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 218#multiple_ofENTRY ~n := #in~n;~m := #in~m; 244#L30 assume !(~m < 0); 240#L33 assume !(~n < 0); 228#L36 assume !(0 == ~m); 229#L39 assume 0 == ~n;#res := 1; 212#multiple_ofFINAL assume true; 241#multiple_ofEXIT >#111#return; 234#L42-1 #res := #t~ret4;havoc #t~ret4; 235#multiple_ofFINAL assume true; 246#multiple_ofEXIT >#121#return; 243#L66-1 assume !(0 == #t~ret6);havoc #t~ret6; 223#L69 call #t~ret7 := is_prime_(~n, ~m - 1);< 230#is_prime_ENTRY [2019-01-01 23:53:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash 72718, now seen corresponding path program 3 times [2019-01-01 23:53:31,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:31,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:31,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:31,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:31,202 INFO L82 PathProgramCache]: Analyzing trace with hash 326750000, now seen corresponding path program 1 times [2019-01-01 23:53:31,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:31,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:31,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:31,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1599788093, now seen corresponding path program 1 times [2019-01-01 23:53:31,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:31,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:31,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:31,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:31,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:53:31,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:31,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:31,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:31,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:53:31,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:31,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-01 23:53:32,010 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 23:53:32,311 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-01-01 23:53:32,546 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-01-01 23:53:32,614 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:32,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:32,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:32,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:32,616 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:32,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:32,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:32,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:32,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2019-01-01 23:53:32,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:32,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:32,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:32,843 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:32,844 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:32,857 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:32,857 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:32,882 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:32,882 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:32,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:32,916 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:32,930 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:32,930 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 23:53:32,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:32,981 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:32,993 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:32,994 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret6=0} Honda state: {is_prime__#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:33,068 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:33,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:33,088 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:33,088 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret7=0} Honda state: {is_prime__#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:33,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:33,125 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:33,152 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:33,152 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:33,184 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:33,186 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:33,186 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:33,186 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:33,186 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:33,187 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:33,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:33,187 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:33,187 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:33,187 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration3_Loop [2019-01-01 23:53:33,187 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:33,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:33,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:33,359 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:33,365 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:33,367 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 [2019-01-01 23:53:33,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,375 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 [2019-01-01 23:53:33,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,378 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 [2019-01-01 23:53:33,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:33,382 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 [2019-01-01 23:53:33,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:33,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:33,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:33,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:33,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:33,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:33,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:33,391 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:33,404 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 23:53:33,404 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 23:53:33,406 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:33,406 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:33,407 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:33,407 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2019-01-01 23:53:33,408 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:33,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:33,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 23:53:33,939 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 [2019-01-01 23:53:33,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16 Second operand 10 states. [2019-01-01 23:53:34,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 16. Second operand 10 states. Result 174 states and 238 transitions. Complement of second has 40 states. [2019-01-01 23:53:34,883 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 [2019-01-01 23:53:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 23:53:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2019-01-01 23:53:34,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 24 letters. [2019-01-01 23:53:34,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:34,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 27 letters. Loop has 24 letters. [2019-01-01 23:53:34,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:34,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 44 transitions. Stem has 3 letters. Loop has 48 letters. [2019-01-01 23:53:34,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:34,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 238 transitions. [2019-01-01 23:53:34,898 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2019-01-01 23:53:34,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 150 states and 200 transitions. [2019-01-01 23:53:34,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2019-01-01 23:53:34,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-01-01 23:53:34,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 200 transitions. [2019-01-01 23:53:34,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:34,909 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 200 transitions. [2019-01-01 23:53:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 200 transitions. [2019-01-01 23:53:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2019-01-01 23:53:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 23:53:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 138 transitions. [2019-01-01 23:53:34,927 INFO L728 BuchiCegarLoop]: Abstraction has 107 states and 138 transitions. [2019-01-01 23:53:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 23:53:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 23:53:34,928 INFO L87 Difference]: Start difference. First operand 107 states and 138 transitions. Second operand 9 states. [2019-01-01 23:53:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:35,223 INFO L93 Difference]: Finished difference Result 145 states and 192 transitions. [2019-01-01 23:53:35,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 23:53:35,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 192 transitions. [2019-01-01 23:53:35,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-01-01 23:53:35,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 139 states and 184 transitions. [2019-01-01 23:53:35,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2019-01-01 23:53:35,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2019-01-01 23:53:35,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 184 transitions. [2019-01-01 23:53:35,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:35,236 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 184 transitions. [2019-01-01 23:53:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 184 transitions. [2019-01-01 23:53:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 111. [2019-01-01 23:53:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 23:53:35,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 144 transitions. [2019-01-01 23:53:35,250 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-01-01 23:53:35,250 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 144 transitions. [2019-01-01 23:53:35,250 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 23:53:35,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 144 transitions. [2019-01-01 23:53:35,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2019-01-01 23:53:35,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:35,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:35,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:35,254 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:35,254 INFO L794 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 965#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 942#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 957#is_prime_ENTRY ~n := #in~n;~m := #in~m; 959#L56 assume !(~n <= 1); 941#L59 assume !(2 == ~n); 944#L62 assume ~n > 2; 962#L63 assume !(~m <= 1); 936#L66 call #t~ret6 := multiple_of(~n, ~m);< 994#multiple_ofENTRY ~n := #in~n;~m := #in~m; 1022#L30 assume ~m < 0; 969#L31 [2019-01-01 23:53:35,254 INFO L796 eck$LassoCheckResult]: Loop: 969#L31 call #t~ret2 := multiple_of(~n, -~m);< 973#multiple_ofENTRY ~n := #in~n;~m := #in~m; 990#L30 assume ~m < 0; 969#L31 [2019-01-01 23:53:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 313603312, now seen corresponding path program 1 times [2019-01-01 23:53:35,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:35,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:35,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:35,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:35,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:53:35,290 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 131660, now seen corresponding path program 1 times [2019-01-01 23:53:35,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:35,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:35,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:35,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:35,413 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:35,414 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:35,414 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:35,414 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:35,414 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:35,414 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:35,414 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:35,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:35,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2019-01-01 23:53:35,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:35,415 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:35,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:35,493 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:35,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:35,497 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,497 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,501 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,501 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret4=0} Honda state: {multiple_of_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:35,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,532 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,532 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=4, multiple_of_#in~n=4} Honda state: {multiple_of_~n=4, multiple_of_#in~n=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:35,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,560 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:35,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:35,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:35,585 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret3=0} Honda state: {multiple_of_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:35,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:35,609 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:35,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:35,633 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:36,440 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:36,442 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:36,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:36,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:36,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:36,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:36,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:36,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:36,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:36,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration4_Loop [2019-01-01 23:53:36,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:36,444 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:36,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:36,525 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:36,526 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:36,526 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 [2019-01-01 23:53:36,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:36,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:36,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:36,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:36,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:36,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:36,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:36,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:36,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 [2019-01-01 23:53:36,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:36,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:36,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:36,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:36,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:36,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:36,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:36,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:36,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 [2019-01-01 23:53:36,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:36,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:36,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:36,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:36,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:36,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:36,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:36,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:36,537 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 [2019-01-01 23:53:36,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:36,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:36,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:36,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:36,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:36,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:36,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:36,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:36,544 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 [2019-01-01 23:53:36,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:36,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:36,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:36,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:36,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:36,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:36,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:36,551 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:36,554 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:36,554 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:36,554 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:36,554 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:36,555 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:36,555 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2019-01-01 23:53:36,555 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:36,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:36,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:36,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:36,639 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 [2019-01-01 23:53:36,639 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37 Second operand 4 states. [2019-01-01 23:53:36,759 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 144 transitions. cyclomatic complexity: 37. Second operand 4 states. Result 209 states and 271 transitions. Complement of second has 18 states. [2019-01-01 23:53:36,761 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 [2019-01-01 23:53:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:53:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2019-01-01 23:53:36,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 23:53:36,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:36,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-01 23:53:36,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:36,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 66 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-01 23:53:36,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:36,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 271 transitions. [2019-01-01 23:53:36,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 34 [2019-01-01 23:53:36,782 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 155 states and 200 transitions. [2019-01-01 23:53:36,782 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-01-01 23:53:36,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2019-01-01 23:53:36,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 200 transitions. [2019-01-01 23:53:36,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:36,784 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 200 transitions. [2019-01-01 23:53:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 200 transitions. [2019-01-01 23:53:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2019-01-01 23:53:36,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 23:53:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2019-01-01 23:53:36,796 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 164 transitions. [2019-01-01 23:53:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:36,797 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 5 states. [2019-01-01 23:53:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:36,950 INFO L93 Difference]: Finished difference Result 114 states and 144 transitions. [2019-01-01 23:53:36,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 23:53:36,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 144 transitions. [2019-01-01 23:53:36,953 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:53:36,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 144 transitions. [2019-01-01 23:53:36,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2019-01-01 23:53:36,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2019-01-01 23:53:36,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 144 transitions. [2019-01-01 23:53:36,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:36,957 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-01-01 23:53:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 144 transitions. [2019-01-01 23:53:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-01-01 23:53:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 23:53:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2019-01-01 23:53:36,967 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-01-01 23:53:36,968 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 140 transitions. [2019-01-01 23:53:36,968 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 23:53:36,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 140 transitions. [2019-01-01 23:53:36,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:53:36,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:36,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:36,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:36,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:36,971 INFO L794 eck$LassoCheckResult]: Stem: 1623#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 1605#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 1585#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 1597#is_prime_ENTRY ~n := #in~n;~m := #in~m; 1599#L56 assume ~n <= 1;#res := 0; 1586#is_prime_FINAL assume true; 1632#is_prime_EXIT >#117#return; 1592#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 1582#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 1583#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 1615#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 1616#L95 assume main_#t~short13; 1575#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 1591#multENTRY [2019-01-01 23:53:36,973 INFO L796 eck$LassoCheckResult]: Loop: 1591#multENTRY ~n := #in~n;~m := #in~m; 1573#L16 assume ~m < 0; 1576#L17 call #t~ret0 := mult(~n, -~m);< 1591#multENTRY [2019-01-01 23:53:36,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:36,974 INFO L82 PathProgramCache]: Analyzing trace with hash -312507047, now seen corresponding path program 1 times [2019-01-01 23:53:36,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:36,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:36,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:36,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:37,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:37,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:53:37,040 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash 53804, now seen corresponding path program 1 times [2019-01-01 23:53:37,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:37,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:37,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:37,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:37,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:37,104 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:37,104 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:37,104 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:37,104 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:37,104 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:37,104 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,104 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:37,105 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:37,105 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2019-01-01 23:53:37,105 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:37,105 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:37,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,205 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:37,206 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,225 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,225 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,248 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,249 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,272 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,272 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,297 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,297 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,321 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,321 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,343 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,346 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:37,346 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:37,368 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:37,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:37,391 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:37,417 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:37,419 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:37,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:37,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:37,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:37,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:37,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:37,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:37,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:37,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration5_Loop [2019-01-01 23:53:37,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:37,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:37,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:37,516 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:37,517 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:37,518 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 [2019-01-01 23:53:37,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,525 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 [2019-01-01 23:53:37,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,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 [2019-01-01 23:53:37,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,537 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 [2019-01-01 23:53:37,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,543 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 [2019-01-01 23:53:37,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,549 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 [2019-01-01 23:53:37,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:37,553 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 [2019-01-01 23:53:37,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:37,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:37,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:37,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:37,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:37,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:37,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:37,557 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:37,559 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:37,560 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:37,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:37,560 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:37,560 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:37,561 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2019-01-01 23:53:37,561 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:37,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:37,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:37,874 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 [2019-01-01 23:53:37,874 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34 Second operand 5 states. [2019-01-01 23:53:38,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110 states and 140 transitions. cyclomatic complexity: 34. Second operand 5 states. Result 142 states and 176 transitions. Complement of second has 14 states. [2019-01-01 23:53:38,165 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 [2019-01-01 23:53:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:53:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2019-01-01 23:53:38,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 3 letters. [2019-01-01 23:53:38,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:38,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 16 letters. Loop has 3 letters. [2019-01-01 23:53:38,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:38,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 13 letters. Loop has 6 letters. [2019-01-01 23:53:38,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:38,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 176 transitions. [2019-01-01 23:53:38,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:53:38,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 134 states and 168 transitions. [2019-01-01 23:53:38,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 79 [2019-01-01 23:53:38,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2019-01-01 23:53:38,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 168 transitions. [2019-01-01 23:53:38,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:38,180 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 168 transitions. [2019-01-01 23:53:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 168 transitions. [2019-01-01 23:53:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2019-01-01 23:53:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-01 23:53:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 154 transitions. [2019-01-01 23:53:38,204 INFO L728 BuchiCegarLoop]: Abstraction has 121 states and 154 transitions. [2019-01-01 23:53:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:53:38,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:53:38,205 INFO L87 Difference]: Start difference. First operand 121 states and 154 transitions. Second operand 7 states. [2019-01-01 23:53:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:38,488 INFO L93 Difference]: Finished difference Result 130 states and 163 transitions. [2019-01-01 23:53:38,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:53:38,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 163 transitions. [2019-01-01 23:53:38,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:53:38,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 154 transitions. [2019-01-01 23:53:38,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-01 23:53:38,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-01 23:53:38,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 154 transitions. [2019-01-01 23:53:38,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:38,497 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 154 transitions. [2019-01-01 23:53:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 154 transitions. [2019-01-01 23:53:38,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-01-01 23:53:38,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 23:53:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2019-01-01 23:53:38,505 INFO L728 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-01-01 23:53:38,505 INFO L608 BuchiCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-01-01 23:53:38,505 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 23:53:38,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 151 transitions. [2019-01-01 23:53:38,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:53:38,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:38,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:38,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:38,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 23:53:38,509 INFO L794 eck$LassoCheckResult]: Stem: 2228#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 2206#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 2185#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 2195#is_prime_ENTRY ~n := #in~n;~m := #in~m; 2198#L56 assume !(~n <= 1); 2241#L59 assume !(2 == ~n); 2242#L62 assume ~n > 2; 2202#L63 assume !(~m <= 1); 2173#L66 call #t~ret6 := multiple_of(~n, ~m);< 2233#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2231#L30 assume !(~m < 0); 2219#L33 assume ~n < 0; 2160#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2019-01-01 23:53:38,510 INFO L796 eck$LassoCheckResult]: Loop: 2175#multiple_ofENTRY ~n := #in~n;~m := #in~m; 2235#L30 assume !(~m < 0); 2260#L33 assume ~n < 0; 2161#L34 call #t~ret3 := multiple_of(-~n, ~m);< 2175#multiple_ofENTRY [2019-01-01 23:53:38,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:38,510 INFO L82 PathProgramCache]: Analyzing trace with hash 725075382, now seen corresponding path program 1 times [2019-01-01 23:53:38,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:38,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:38,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:38,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:38,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 23:53:38,633 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash 929674, now seen corresponding path program 1 times [2019-01-01 23:53:38,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:38,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:38,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:38,705 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:38,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:38,706 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:38,706 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:38,706 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:38,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:38,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:38,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:38,707 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2019-01-01 23:53:38,707 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:38,707 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:38,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,839 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:38,839 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:38,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:38,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:38,851 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:38,851 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:38,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:38,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:38,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:38,875 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:38,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:38,900 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:38,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:38,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:38,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:38,923 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:38,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:38,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:38,973 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:38,975 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:38,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:38,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:38,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:38,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:38,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:38,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:38,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:38,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration6_Loop [2019-01-01 23:53:38,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:38,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:38,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:38,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:39,082 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:39,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:39,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:39,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:39,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:39,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:39,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:39,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:39,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:39,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:39,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:39,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:39,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:39,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:39,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:39,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:39,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:39,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:39,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:39,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:39,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:39,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:39,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:39,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:39,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:39,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:39,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:39,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:39,090 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 [2019-01-01 23:53:39,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:39,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:39,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:39,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:39,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:39,091 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:39,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:39,093 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:39,095 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:39,095 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:39,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:39,096 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:39,096 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:39,096 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2019-01-01 23:53:39,096 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:39,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:39,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:39,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:39,252 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 [2019-01-01 23:53:39,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36 Second operand 4 states. [2019-01-01 23:53:39,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 151 transitions. cyclomatic complexity: 36. Second operand 4 states. Result 270 states and 352 transitions. Complement of second has 13 states. [2019-01-01 23:53:39,335 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 [2019-01-01 23:53:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 23:53:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2019-01-01 23:53:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 4 letters. [2019-01-01 23:53:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 17 letters. Loop has 4 letters. [2019-01-01 23:53:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 13 letters. Loop has 8 letters. [2019-01-01 23:53:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:39,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 352 transitions. [2019-01-01 23:53:39,341 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2019-01-01 23:53:39,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 246 states and 328 transitions. [2019-01-01 23:53:39,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2019-01-01 23:53:39,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2019-01-01 23:53:39,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 328 transitions. [2019-01-01 23:53:39,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:39,347 INFO L705 BuchiCegarLoop]: Abstraction has 246 states and 328 transitions. [2019-01-01 23:53:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 328 transitions. [2019-01-01 23:53:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2019-01-01 23:53:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-01 23:53:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2019-01-01 23:53:39,361 INFO L728 BuchiCegarLoop]: Abstraction has 216 states and 283 transitions. [2019-01-01 23:53:39,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 23:53:39,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 23:53:39,362 INFO L87 Difference]: Start difference. First operand 216 states and 283 transitions. Second operand 7 states. [2019-01-01 23:53:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:39,684 INFO L93 Difference]: Finished difference Result 214 states and 279 transitions. [2019-01-01 23:53:39,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:53:39,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 279 transitions. [2019-01-01 23:53:39,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 23:53:39,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 279 transitions. [2019-01-01 23:53:39,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2019-01-01 23:53:39,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2019-01-01 23:53:39,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 279 transitions. [2019-01-01 23:53:39,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:39,697 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2019-01-01 23:53:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 279 transitions. [2019-01-01 23:53:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-01-01 23:53:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-01 23:53:39,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2019-01-01 23:53:39,721 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2019-01-01 23:53:39,722 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 279 transitions. [2019-01-01 23:53:39,722 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 23:53:39,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 279 transitions. [2019-01-01 23:53:39,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 23:53:39,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:39,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:39,728 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:39,728 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:53:39,729 INFO L794 eck$LassoCheckResult]: Stem: 3156#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3126#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3114#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3115#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3118#L56 assume !(~n <= 1); 3171#L59 assume !(2 == ~n); 3172#L62 assume ~n > 2; 3173#L63 assume !(~m <= 1); 3161#L66 call #t~ret6 := multiple_of(~n, ~m);< 3168#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3160#L30 assume !(~m < 0); 3162#L33 assume !(~n < 0); 3226#L36 assume !(0 == ~m); 3224#L39 assume !(0 == ~n); 3072#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2019-01-01 23:53:39,729 INFO L796 eck$LassoCheckResult]: Loop: 3194#multiple_ofENTRY ~n := #in~n;~m := #in~m; 3192#L30 assume !(~m < 0); 3186#L33 assume !(~n < 0); 3187#L36 assume !(0 == ~m); 3225#L39 assume !(0 == ~n); 3071#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 3194#multiple_ofENTRY [2019-01-01 23:53:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1012741841, now seen corresponding path program 1 times [2019-01-01 23:53:39,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:39,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:39,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash 893418405, now seen corresponding path program 1 times [2019-01-01 23:53:39,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:39,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:39,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2089986443, now seen corresponding path program 2 times [2019-01-01 23:53:39,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:39,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:39,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:39,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:39,920 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:39,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:39,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:39,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:39,920 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:39,921 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:39,921 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:39,921 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:39,921 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2019-01-01 23:53:39,921 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:39,921 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:39,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:39,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:40,024 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:40,029 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,030 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:40,032 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:40,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:40,054 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:40,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:40,077 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:40,182 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:40,184 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:40,184 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:40,184 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:40,184 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:40,184 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:40,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,185 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:40,185 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:40,185 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration7_Loop [2019-01-01 23:53:40,185 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:40,185 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:40,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,314 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:40,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:40,315 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 [2019-01-01 23:53:40,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:40,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:40,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:40,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:40,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:40,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:40,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:40,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:40,320 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 [2019-01-01 23:53:40,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:40,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:40,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:40,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:40,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:40,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:40,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:40,327 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:40,352 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:40,352 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:53:40,353 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:40,353 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:40,353 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:40,353 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2019-01-01 23:53:40,356 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:40,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:40,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:40,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:40,517 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 [2019-01-01 23:53:40,517 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75 Second operand 6 states. [2019-01-01 23:53:40,635 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 279 transitions. cyclomatic complexity: 75. Second operand 6 states. Result 313 states and 413 transitions. Complement of second has 21 states. [2019-01-01 23:53:40,639 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 [2019-01-01 23:53:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:53:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2019-01-01 23:53:40,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 23:53:40,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:40,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 21 letters. Loop has 6 letters. [2019-01-01 23:53:40,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:40,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 42 transitions. Stem has 15 letters. Loop has 12 letters. [2019-01-01 23:53:40,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:40,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 413 transitions. [2019-01-01 23:53:40,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 32 [2019-01-01 23:53:40,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 282 states and 365 transitions. [2019-01-01 23:53:40,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2019-01-01 23:53:40,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2019-01-01 23:53:40,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 365 transitions. [2019-01-01 23:53:40,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:40,658 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 365 transitions. [2019-01-01 23:53:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 365 transitions. [2019-01-01 23:53:40,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 249. [2019-01-01 23:53:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-01 23:53:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 323 transitions. [2019-01-01 23:53:40,677 INFO L728 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2019-01-01 23:53:40,677 INFO L608 BuchiCegarLoop]: Abstraction has 249 states and 323 transitions. [2019-01-01 23:53:40,677 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 23:53:40,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 323 transitions. [2019-01-01 23:53:40,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 23:53:40,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:40,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:40,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:40,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 23:53:40,682 INFO L794 eck$LassoCheckResult]: Stem: 3796#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 3766#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 3754#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 3755#is_prime_ENTRY ~n := #in~n;~m := #in~m; 3758#L56 assume !(~n <= 1); 3845#L59 assume 2 == ~n;#res := 1; 3843#is_prime_FINAL assume true; 3810#is_prime_EXIT >#117#return; 3746#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 3732#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 3733#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 3776#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 3777#L95 assume main_#t~short13; 3721#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 3756#multENTRY ~n := #in~n;~m := #in~m; 3720#L16 assume !(~m < 0); 3723#L19 [2019-01-01 23:53:40,682 INFO L796 eck$LassoCheckResult]: Loop: 3723#L19 assume !(0 == ~m); 3772#L22 assume !(1 == ~m); 3743#L25 call #t~ret1 := mult(~n, ~m - 1);< 3745#multENTRY ~n := #in~n;~m := #in~m; 3784#L16 assume !(~m < 0); 3723#L19 [2019-01-01 23:53:40,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:40,683 INFO L82 PathProgramCache]: Analyzing trace with hash -53610220, now seen corresponding path program 1 times [2019-01-01 23:53:40,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:40,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:40,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:40,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash 61271251, now seen corresponding path program 1 times [2019-01-01 23:53:40,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:40,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:40,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:40,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 102279072, now seen corresponding path program 1 times [2019-01-01 23:53:40,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:40,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:40,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:40,882 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 23:53:40,970 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:40,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:40,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:40,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:40,970 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:40,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:40,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:40,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:40,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2019-01-01 23:53:40,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:40,971 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:40,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:40,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:41,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:41,156 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-01 23:53:41,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:41,204 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:41,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:41,207 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:41,210 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:41,210 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:41,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:41,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:41,237 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:41,237 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:41,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:41,259 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:41,285 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:41,285 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:42,246 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:42,248 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:42,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:42,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:42,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:42,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:42,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:42,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:42,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration8_Loop [2019-01-01 23:53:42,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:42,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:42,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,320 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:42,321 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:42,321 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 [2019-01-01 23:53:42,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:42,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:42,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:42,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:42,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:42,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:42,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:42,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:42,324 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 [2019-01-01 23:53:42,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:42,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:42,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:42,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:42,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:42,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:42,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:42,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:42,326 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 [2019-01-01 23:53:42,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:42,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:42,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:42,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:42,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:42,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:42,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:42,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:42,329 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 [2019-01-01 23:53:42,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:42,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:42,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:42,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:42,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:42,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:42,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:42,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:42,332 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 [2019-01-01 23:53:42,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:42,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:42,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:42,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:42,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:42,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:42,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:42,336 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:42,338 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:42,338 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:53:42,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:42,338 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:42,338 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:42,338 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2019-01-01 23:53:42,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:42,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:42,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:42,525 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 [2019-01-01 23:53:42,525 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86 Second operand 6 states. [2019-01-01 23:53:42,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 323 transitions. cyclomatic complexity: 86. Second operand 6 states. Result 273 states and 350 transitions. Complement of second has 17 states. [2019-01-01 23:53:42,739 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 [2019-01-01 23:53:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:53:42,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2019-01-01 23:53:42,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 5 letters. [2019-01-01 23:53:42,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:42,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 21 letters. Loop has 5 letters. [2019-01-01 23:53:42,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:42,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 51 transitions. Stem has 16 letters. Loop has 10 letters. [2019-01-01 23:53:42,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:42,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 350 transitions. [2019-01-01 23:53:42,745 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 23:53:42,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 272 states and 349 transitions. [2019-01-01 23:53:42,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2019-01-01 23:53:42,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 133 [2019-01-01 23:53:42,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 272 states and 349 transitions. [2019-01-01 23:53:42,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:42,750 INFO L705 BuchiCegarLoop]: Abstraction has 272 states and 349 transitions. [2019-01-01 23:53:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states and 349 transitions. [2019-01-01 23:53:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 259. [2019-01-01 23:53:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-01 23:53:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 335 transitions. [2019-01-01 23:53:42,768 INFO L728 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2019-01-01 23:53:42,768 INFO L608 BuchiCegarLoop]: Abstraction has 259 states and 335 transitions. [2019-01-01 23:53:42,768 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 23:53:42,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259 states and 335 transitions. [2019-01-01 23:53:42,772 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 23:53:42,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:42,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:42,774 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] [2019-01-01 23:53:42,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 23:53:42,776 INFO L794 eck$LassoCheckResult]: Stem: 4428#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 4393#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 4380#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 4381#is_prime_ENTRY ~n := #in~n;~m := #in~m; 4384#L56 assume !(~n <= 1); 4444#L59 assume 2 == ~n;#res := 1; 4443#is_prime_FINAL assume true; 4441#is_prime_EXIT >#117#return; 4373#L51-1 is_prime_#res := is_prime_#t~ret5;havoc is_prime_#t~ret5; 4357#L51-2 main_#t~ret9 := is_prime_#res;main_~result~0 := main_#t~ret9;havoc main_#t~ret9;main_~f1~0 := main_#t~nondet10;havoc main_#t~nondet10; 4358#L83 assume !(main_~f1~0 < 1 || main_~f1~0 > 46340);main_~f2~0 := main_#t~nondet11;havoc main_#t~nondet11; 4407#L89 assume !(main_~f2~0 < 1 || main_~f2~0 > 46340);main_#t~short13 := 1 == main_~result~0; 4408#L95 assume main_#t~short13; 4348#L95-1 call main_#t~ret12 := mult(main_~f1~0, main_~f2~0);< 4382#multENTRY ~n := #in~n;~m := #in~m; 4345#L16 assume !(~m < 0); 4347#L19 assume !(0 == ~m); 4401#L22 assume !(1 == ~m); 4409#L25 call #t~ret1 := mult(~n, ~m - 1);< 4590#multENTRY ~n := #in~n;~m := #in~m; 4449#L16 assume ~m < 0; 4369#L17 [2019-01-01 23:53:42,776 INFO L796 eck$LassoCheckResult]: Loop: 4369#L17 call #t~ret0 := mult(~n, -~m);< 4370#multENTRY ~n := #in~n;~m := #in~m; 4450#L16 assume ~m < 0; 4369#L17 [2019-01-01 23:53:42,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:42,776 INFO L82 PathProgramCache]: Analyzing trace with hash 102279069, now seen corresponding path program 1 times [2019-01-01 23:53:42,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:42,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:42,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:42,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:42,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 23:53:42,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 23:53:42,865 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:42,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash 138194, now seen corresponding path program 2 times [2019-01-01 23:53:42,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:42,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:42,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:42,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:42,922 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:42,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:42,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:42,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:42,923 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:42,923 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:42,923 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:42,923 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:42,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2019-01-01 23:53:42,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:42,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:42,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:42,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:42,990 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:42,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:42,998 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:43,000 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:43,000 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret0=0} Honda state: {mult_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:43,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:43,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:43,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:43,024 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret1=0} Honda state: {mult_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:43,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:43,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:43,049 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:43,049 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0, mult_#in~n=0} Honda state: {mult_~n=0, mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:43,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:43,071 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:43,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:43,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:44,391 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:44,393 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:44,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:44,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:44,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:44,394 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:44,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:44,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:44,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:44,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration9_Loop [2019-01-01 23:53:44,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:44,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:44,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:44,458 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:44,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:44,459 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 [2019-01-01 23:53:44,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:44,463 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 [2019-01-01 23:53:44,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:44,466 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 [2019-01-01 23:53:44,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 23:53:44,478 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 [2019-01-01 23:53:44,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:44,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:44,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:44,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:44,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:44,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:44,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:44,486 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:44,487 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-01-01 23:53:44,487 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 23:53:44,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:44,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:44,490 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:44,490 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2019-01-01 23:53:44,490 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:44,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:44,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:44,600 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 [2019-01-01 23:53:44,600 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89 Second operand 5 states. [2019-01-01 23:53:44,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259 states and 335 transitions. cyclomatic complexity: 89. Second operand 5 states. Result 300 states and 381 transitions. Complement of second has 11 states. [2019-01-01 23:53:44,694 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 [2019-01-01 23:53:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 23:53:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2019-01-01 23:53:44,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 23:53:44,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:44,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 24 letters. Loop has 3 letters. [2019-01-01 23:53:44,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:44,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 21 letters. Loop has 6 letters. [2019-01-01 23:53:44,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:44,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 381 transitions. [2019-01-01 23:53:44,702 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2019-01-01 23:53:44,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 290 states and 371 transitions. [2019-01-01 23:53:44,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 141 [2019-01-01 23:53:44,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2019-01-01 23:53:44,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 371 transitions. [2019-01-01 23:53:44,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:44,707 INFO L705 BuchiCegarLoop]: Abstraction has 290 states and 371 transitions. [2019-01-01 23:53:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 371 transitions. [2019-01-01 23:53:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 277. [2019-01-01 23:53:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-01 23:53:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 357 transitions. [2019-01-01 23:53:44,715 INFO L728 BuchiCegarLoop]: Abstraction has 277 states and 357 transitions. [2019-01-01 23:53:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 23:53:44,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 23:53:44,716 INFO L87 Difference]: Start difference. First operand 277 states and 357 transitions. Second operand 5 states. [2019-01-01 23:53:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:44,792 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-01-01 23:53:44,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 23:53:44,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 348 transitions. [2019-01-01 23:53:44,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2019-01-01 23:53:44,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 196 states and 236 transitions. [2019-01-01 23:53:44,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-01-01 23:53:44,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-01-01 23:53:44,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 236 transitions. [2019-01-01 23:53:44,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:44,799 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 236 transitions. [2019-01-01 23:53:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 236 transitions. [2019-01-01 23:53:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2019-01-01 23:53:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-01-01 23:53:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2019-01-01 23:53:44,804 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-01-01 23:53:44,804 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 209 transitions. [2019-01-01 23:53:44,804 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 23:53:44,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 209 transitions. [2019-01-01 23:53:44,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-01 23:53:44,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:44,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:44,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:44,806 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-01 23:53:44,807 INFO L794 eck$LassoCheckResult]: Stem: 5597#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 5598#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 5569#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 5585#is_prime_ENTRY ~n := #in~n;~m := #in~m; 5586#L56 assume !(~n <= 1); 5680#L59 assume !(2 == ~n); 5679#L62 assume ~n > 2; 5678#L63 assume !(~m <= 1); 5666#L66 call #t~ret6 := multiple_of(~n, ~m);< 5675#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5673#L30 assume !(~m < 0); 5671#L33 assume !(~n < 0); 5670#L36 assume !(0 == ~m); 5668#L39 assume !(0 == ~n); 5612#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5664#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5663#L30 assume !(~m < 0); 5712#L33 assume ~n < 0; 5555#L34 call #t~ret3 := multiple_of(-~n, ~m);< 5692#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5606#L30 assume !(~m < 0); 5552#L33 assume !(~n < 0); 5554#L36 [2019-01-01 23:53:44,807 INFO L796 eck$LassoCheckResult]: Loop: 5554#L36 assume !(0 == ~m); 5582#L39 assume !(0 == ~n); 5574#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 5573#multiple_ofENTRY ~n := #in~n;~m := #in~m; 5711#L30 assume !(~m < 0); 5702#L33 assume !(~n < 0); 5554#L36 [2019-01-01 23:53:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:44,807 INFO L82 PathProgramCache]: Analyzing trace with hash -365122516, now seen corresponding path program 1 times [2019-01-01 23:53:44,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:44,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:44,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:44,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:44,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:44,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 23:53:44,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:44,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:44,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:45,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 23:53:45,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-01 23:53:45,014 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 23:53:45,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1367317725, now seen corresponding path program 2 times [2019-01-01 23:53:45,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:45,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:45,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:45,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:45,115 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:45,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:45,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:45,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:45,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 23:53:45,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:45,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:45,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:45,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2019-01-01 23:53:45,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:45,117 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:45,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:45,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:45,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:45,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:45,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:45,233 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:45,233 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:45,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:45,240 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:45,242 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 23:53:45,242 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret2=0} Honda state: {multiple_of_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:45,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 23:53:45,262 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-01 23:53:45,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 23:53:45,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 23:53:47,151 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 23:53:47,154 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 23:53:47,154 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 23:53:47,154 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 23:53:47,154 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 23:53:47,154 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 23:53:47,154 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 23:53:47,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 23:53:47,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 23:53:47,155 INFO L131 ssoRankerPreferences]: Filename of dumped script: Primes_true-unreach-call_true-no-overflow_false-termination.c_Iteration10_Loop [2019-01-01 23:53:47,155 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 23:53:47,155 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 23:53:47,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:47,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:47,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:47,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 23:53:47,265 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 23:53:47,266 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 23:53:47,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 23:53:47,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 23:53:47,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 23:53:47,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 23:53:47,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 23:53:47,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 23:53:47,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 23:53:47,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 23:53:47,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 23:53:47,273 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 23:53:47,273 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 23:53:47,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 23:53:47,273 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 23:53:47,273 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 23:53:47,274 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~n) = 1*multiple_of_~n Supporting invariants [] [2019-01-01 23:53:47,274 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 23:53:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:47,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:47,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:47,499 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 [2019-01-01 23:53:47,499 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-01-01 23:53:47,642 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2019-01-01 23:53:47,644 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 [2019-01-01 23:53:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:53:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 23:53:47,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-01 23:53:47,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:47,647 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:47,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:47,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:47,813 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 [2019-01-01 23:53:47,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-01-01 23:53:47,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 197 states and 241 transitions. Complement of second has 15 states. [2019-01-01 23:53:47,960 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 [2019-01-01 23:53:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:53:47,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 23:53:47,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-01 23:53:47,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:47,961 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 23:53:47,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:48,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 23:53:48,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 23:53:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 23:53:48,120 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 [2019-01-01 23:53:48,120 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49 Second operand 6 states. [2019-01-01 23:53:48,339 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 209 transitions. cyclomatic complexity: 49. Second operand 6 states. Result 265 states and 319 transitions. Complement of second has 16 states. [2019-01-01 23:53:48,342 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 [2019-01-01 23:53:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 23:53:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2019-01-01 23:53:48,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-01 23:53:48,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:48,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 28 letters. Loop has 6 letters. [2019-01-01 23:53:48,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:48,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 22 letters. Loop has 12 letters. [2019-01-01 23:53:48,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 23:53:48,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 265 states and 319 transitions. [2019-01-01 23:53:48,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-01 23:53:48,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 265 states to 223 states and 270 transitions. [2019-01-01 23:53:48,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-01 23:53:48,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-01-01 23:53:48,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 223 states and 270 transitions. [2019-01-01 23:53:48,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:48,350 INFO L705 BuchiCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-01-01 23:53:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states and 270 transitions. [2019-01-01 23:53:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 182. [2019-01-01 23:53:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-01 23:53:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2019-01-01 23:53:48,356 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 226 transitions. [2019-01-01 23:53:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 23:53:48,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 23:53:48,356 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand 8 states. [2019-01-01 23:53:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 23:53:48,759 INFO L93 Difference]: Finished difference Result 243 states and 299 transitions. [2019-01-01 23:53:48,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 23:53:48,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 299 transitions. [2019-01-01 23:53:48,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 23:53:48,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 233 states and 289 transitions. [2019-01-01 23:53:48,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2019-01-01 23:53:48,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2019-01-01 23:53:48,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 289 transitions. [2019-01-01 23:53:48,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 23:53:48,768 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 289 transitions. [2019-01-01 23:53:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 289 transitions. [2019-01-01 23:53:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 212. [2019-01-01 23:53:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-01 23:53:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2019-01-01 23:53:48,774 INFO L728 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2019-01-01 23:53:48,774 INFO L608 BuchiCegarLoop]: Abstraction has 212 states and 266 transitions. [2019-01-01 23:53:48,774 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 23:53:48,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 212 states and 266 transitions. [2019-01-01 23:53:48,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-01-01 23:53:48,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 23:53:48,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 23:53:48,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:48,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-01 23:53:48,777 INFO L794 eck$LassoCheckResult]: Stem: 7270#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet8, main_#t~ret9, main_#t~nondet10, main_#t~nondet11, main_#t~ret12, main_#t~short13, main_~n~0, main_~result~0, main_~f1~0, main_~f2~0;main_~n~0 := main_#t~nondet8;havoc main_#t~nondet8; 7271#L76 assume !(main_~n~0 < 1 || main_~n~0 > 46340);is_prime_#in~n := main_~n~0;havoc is_prime_#res;havoc is_prime_#t~ret5, is_prime_~n;is_prime_~n := is_prime_#in~n; 7234#L51 call is_prime_#t~ret5 := is_prime_(is_prime_~n, is_prime_~n - 1);< 7256#is_prime_ENTRY ~n := #in~n;~m := #in~m; 7257#L56 assume !(~n <= 1); 7278#L59 assume !(2 == ~n); 7262#L62 assume ~n > 2; 7263#L63 assume !(~m <= 1); 7252#L66 call #t~ret6 := multiple_of(~n, ~m);< 7282#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7275#L30 assume !(~m < 0); 7276#L33 assume !(~n < 0); 7251#L36 assume !(0 == ~m); 7253#L39 assume !(0 == ~n); 7267#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7334#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7333#L30 assume !(~m < 0); 7332#L33 assume !(~n < 0); 7329#L36 assume !(0 == ~m); 7266#L39 assume !(0 == ~n); 7242#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7288#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7318#L30 assume !(~m < 0); 7316#L33 assume ~n < 0; 7241#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7243#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7325#L30 assume !(~m < 0); 7324#L33 assume !(~n < 0); 7313#L36 [2019-01-01 23:53:48,777 INFO L796 eck$LassoCheckResult]: Loop: 7313#L36 assume !(0 == ~m); 7321#L39 assume !(0 == ~n); 7300#L42 call #t~ret4 := multiple_of(~n - ~m, ~m);< 7319#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7317#L30 assume !(~m < 0); 7299#L33 assume ~n < 0; 7301#L34 call #t~ret3 := multiple_of(-~n, ~m);< 7315#multiple_ofENTRY ~n := #in~n;~m := #in~m; 7314#L30 assume !(~m < 0); 7312#L33 assume !(~n < 0); 7313#L36 [2019-01-01 23:53:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1641835528, now seen corresponding path program 2 times [2019-01-01 23:53:48,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash 478329012, now seen corresponding path program 1 times [2019-01-01 23:53:48,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 23:53:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 23:53:48,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1762199547, now seen corresponding path program 3 times [2019-01-01 23:53:48,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 23:53:48,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 23:53:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 23:53:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 23:53:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 23:53:49,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 11:53:49 BoogieIcfgContainer [2019-01-01 23:53:49,699 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 23:53:49,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 23:53:49,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 23:53:49,700 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 23:53:49,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 11:53:29" (3/4) ... [2019-01-01 23:53:49,705 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2019-01-01 23:53:49,762 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 23:53:49,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 23:53:49,763 INFO L168 Benchmark]: Toolchain (without parser) took 20975.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.9 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 111.0 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:49,764 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:53:49,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:49,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.95 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:53:49,765 INFO L168 Benchmark]: Boogie Preprocessor took 35.78 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:49,766 INFO L168 Benchmark]: RCFGBuilder took 748.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:49,767 INFO L168 Benchmark]: BuchiAutomizer took 19726.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.3 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. [2019-01-01 23:53:49,767 INFO L168 Benchmark]: Witness Printer took 62.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 23:53:49,771 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 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 41.95 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.78 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 748.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19726.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -53.3 MB). Peak memory consumption was 126.5 MB. Max. memory is 11.5 GB. * Witness Printer took 62.75 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (8 trivial, 7 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 9 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(n) and consists of 4 locations. One deterministic module has affine ranking function \old(n) and consists of 6 locations. One deterministic module has affine ranking function m and consists of 6 locations. One deterministic module has affine ranking function m and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 6 locations. 8 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 212 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.6s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 12.5s. Construction of modules took 2.4s. Büchi inclusion checks took 4.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 14. Automata minimization 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 300 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 259 states and ocurred in iteration 8. Nontrivial modules had stage [7, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 694 SDtfs, 704 SDslu, 1147 SDs, 0 SdLazy, 884 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s 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: 8ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 5.6s - 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@6144327=0, \result=0, f1=0, m=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@701e9fef=0, n=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d6811d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@66d419c9=0, result=0, f2=0, m=2, n=1, \result=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3c3c2653=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@133568bc=0, \old(n)=1, \old(m)=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@387ef526=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@18aefb81=0, n=0, \old(n)=0, \result=0, \old(m)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e9cca09=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50e4ea78=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ae08475=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@34536ba5=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 36]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L75] int n = __VERIFIER_nondet_int(); [L76] COND FALSE !(n < 1 || n > 46340) [L51] CALL is_prime_(n, n - 1) [L56] COND FALSE !(n <= 1) [L59] COND FALSE !(n == 2) [L62] COND TRUE n > 2 [L63] COND FALSE !(m <= 1) [L66] CALL multiple_of(n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) Loop: [L36] COND FALSE !(m == 0) [L39] COND FALSE !(n == 0) [L42] CALL multiple_of(n - m, m) [L30] COND FALSE !(m < 0) [L33] COND TRUE n < 0 [L34] CALL multiple_of(-n, m) [L30] COND FALSE !(m < 0) [L33] COND FALSE !(n < 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...