./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive/Primes.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 --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 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:32:04,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:32:04,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:32:04,851 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:32:04,851 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:32:04,852 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:32:04,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:32:04,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:32:04,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:32:04,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:32:04,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:32:04,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:32:04,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:32:04,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:32:04,874 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:32:04,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:32:04,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:32:04,876 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:32:04,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:32:04,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:32:04,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:32:04,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:32:04,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:32:04,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:32:04,878 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:32:04,878 INFO L153 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 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 -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2025-03-09 07:32:05,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:32:05,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:32:05,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:32:05,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:32:05,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:32:05,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2025-03-09 07:32:06,238 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855235a50/d074860868274240bc52f9cee724e086/FLAGbb10756f6 [2025-03-09 07:32:06,455 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:32:06,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2025-03-09 07:32:06,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855235a50/d074860868274240bc52f9cee724e086/FLAGbb10756f6 [2025-03-09 07:32:06,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855235a50/d074860868274240bc52f9cee724e086 [2025-03-09 07:32:06,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:32:06,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:32:06,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:32:06,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:32:06,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:32:06,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2409e783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06, skipping insertion in model container [2025-03-09 07:32:06,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:32:06,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:32:06,668 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:32:06,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:32:06,691 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:32:06,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06 WrapperNode [2025-03-09 07:32:06,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:32:06,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:32:06,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:32:06,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:32:06,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,714 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-03-09 07:32:06,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:32:06,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:32:06,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:32:06,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:32:06,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,728 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:32:06,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:32:06,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:32:06,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:32:06,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:32:06,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (1/1) ... [2025-03-09 07:32:06,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:06,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:32:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2025-03-09 07:32:06,779 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2025-03-09 07:32:06,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:32:06,780 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2025-03-09 07:32:06,780 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2025-03-09 07:32:06,780 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2025-03-09 07:32:06,780 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2025-03-09 07:32:06,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:32:06,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:32:06,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:32:06,827 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:32:06,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:32:06,888 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: havoc #t~ret6; [2025-03-09 07:32:06,888 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc #t~ret8; [2025-03-09 07:32:06,889 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: havoc #t~ret7; [2025-03-09 07:32:06,909 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: havoc #t~ret5; [2025-03-09 07:32:06,913 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: havoc #t~ret4; [2025-03-09 07:32:06,967 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L53: havoc is_prime_#t~ret9#1; [2025-03-09 07:32:06,991 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: havoc #t~ret11; [2025-03-09 07:32:07,008 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-09 07:32:07,008 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:32:07,018 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:32:07,018 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:32:07,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:07 BoogieIcfgContainer [2025-03-09 07:32:07,019 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:32:07,019 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:32:07,019 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:32:07,023 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:32:07,023 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:07,023 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:32:06" (1/3) ... [2025-03-09 07:32:07,026 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c827ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:32:07, skipping insertion in model container [2025-03-09 07:32:07,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:07,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:06" (2/3) ... [2025-03-09 07:32:07,026 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c827ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:32:07, skipping insertion in model container [2025-03-09 07:32:07,026 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:07,026 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:07" (3/3) ... [2025-03-09 07:32:07,027 INFO L363 chiAutomizerObserver]: Analyzing ICFG Primes.c [2025-03-09 07:32:07,072 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:32:07,073 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:32:07,073 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:32:07,073 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:32:07,073 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:32:07,073 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:32:07,073 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:32:07,073 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:32:07,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 07:32:07,094 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-09 07:32:07,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:07,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:07,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:32:07,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:07,100 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:32:07,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 07:32:07,103 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-09 07:32:07,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:07,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:07,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:32:07,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:07,108 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< [2025-03-09 07:32:07,109 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume 0 == ~m;#res := 0;" "assume true;" >"#99#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-09 07:32:07,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2892704, now seen corresponding path program 1 times [2025-03-09 07:32:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871228086] [2025-03-09 07:32:07,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:07,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:07,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:07,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:07,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1766541863, now seen corresponding path program 1 times [2025-03-09 07:32:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984500307] [2025-03-09 07:32:07,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:32:07,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:32:07,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984500307] [2025-03-09 07:32:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984500307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 07:32:07,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440482924] [2025-03-09 07:32:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:07,346 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:32:07,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:07,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:32:07,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:32:07,365 INFO L87 Difference]: Start difference. First operand has 51 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 38 states have internal predecessors, (55), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:07,471 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2025-03-09 07:32:07,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 84 transitions. [2025-03-09 07:32:07,475 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-09 07:32:07,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 41 states and 54 transitions. [2025-03-09 07:32:07,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-09 07:32:07,481 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-03-09 07:32:07,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 54 transitions. [2025-03-09 07:32:07,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:07,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-09 07:32:07,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 54 transitions. [2025-03-09 07:32:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-09 07:32:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 07:32:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2025-03-09 07:32:07,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-09 07:32:07,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:32:07,504 INFO L432 stractBuchiCegarLoop]: Abstraction has 39 states and 51 transitions. [2025-03-09 07:32:07,504 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:32:07,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2025-03-09 07:32:07,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-09 07:32:07,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:07,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:07,505 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:32:07,505 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:07,505 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< [2025-03-09 07:32:07,505 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume 0 == ~n;#res := 1;" "assume true;" >"#99#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-09 07:32:07,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2892704, now seen corresponding path program 2 times [2025-03-09 07:32:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886663116] [2025-03-09 07:32:07,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:07,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:07,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:32:07,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1084166589, now seen corresponding path program 1 times [2025-03-09 07:32:07,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084980425] [2025-03-09 07:32:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:07,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 07:32:07,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 07:32:07,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:07,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:07,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084980425] [2025-03-09 07:32:07,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084980425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:07,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 07:32:07,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145334882] [2025-03-09 07:32:07,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:07,577 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 07:32:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:07,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:32:07,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:32:07,578 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:07,651 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-03-09 07:32:07,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 60 transitions. [2025-03-09 07:32:07,652 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-09 07:32:07,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 60 transitions. [2025-03-09 07:32:07,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-09 07:32:07,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2025-03-09 07:32:07,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2025-03-09 07:32:07,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:07,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-03-09 07:32:07,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2025-03-09 07:32:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-09 07:32:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-09 07:32:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2025-03-09 07:32:07,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-09 07:32:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:32:07,663 INFO L432 stractBuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2025-03-09 07:32:07,664 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:32:07,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2025-03-09 07:32:07,665 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 22 [2025-03-09 07:32:07,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:07,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:07,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:32:07,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:07,668 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< [2025-03-09 07:32:07,668 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume 0 == ~n;#res := 1;" "assume true;" >"#83#return;" "#res := #t~ret8;havoc #t~ret8;" "assume true;" >"#99#return;" "assume !(0 == #t~ret10);havoc #t~ret10;" "call #t~ret11 := is_prime_(~n, ~m - 1);"< [2025-03-09 07:32:07,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2892704, now seen corresponding path program 3 times [2025-03-09 07:32:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013831087] [2025-03-09 07:32:07,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:07,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:07,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:32:07,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,681 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:07,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:07,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash 643323679, now seen corresponding path program 1 times [2025-03-09 07:32:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215171023] [2025-03-09 07:32:07,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:07,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:32:07,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:32:07,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:32:07,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:32:07,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 386616766, now seen corresponding path program 1 times [2025-03-09 07:32:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017276469] [2025-03-09 07:32:07,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:32:07,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:32:07,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 07:32:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017276469] [2025-03-09 07:32:07,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017276469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:32:07,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618892991] [2025-03-09 07:32:07,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:07,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:32:07,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:32:07,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 07:32:08,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:32:08,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:32:08,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 07:32:08,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:32:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 07:32:08,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618892991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:32:08,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:32:08,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-09 07:32:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355642821] [2025-03-09 07:32:08,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:32:08,668 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:08,668 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:08,668 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:08,668 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:08,669 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:08,669 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,669 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:08,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:08,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2025-03-09 07:32:08,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:08,670 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:08,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,735 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:08,735 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:08,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:32:08,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:08,742 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,756 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:08,756 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~m=0} Honda state: {is_prime__~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:08,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-09 07:32:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:32:08,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:08,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,780 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:08,781 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__#t~ret11=0} Honda state: {is_prime__#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:08,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:08,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:32:08,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:08,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,803 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:08,803 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {is_prime__~n=0} Honda state: {is_prime__~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:08,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:32:08,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:08,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:08,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:32:08,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:08,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,996 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:09,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:09,003 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:09,003 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:09,003 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:09,003 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:09,003 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:09,003 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,003 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:09,003 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:09,003 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration3_Loop [2025-03-09 07:32:09,003 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:09,003 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:09,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,061 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:09,064 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:09,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,067 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:32:09,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:09,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:09,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:09,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:09,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:09,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:09,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:09,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:09,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:09,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 07:32:09,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,095 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:32:09,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:09,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:09,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:09,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:09,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:09,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:09,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:09,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:09,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:09,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 07:32:09,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:32:09,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:09,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:09,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:09,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:09,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:09,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:09,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:09,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:09,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:09,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-03-09 07:32:09,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,140 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:32:09,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:09,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:09,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:09,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:09,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:09,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:09,155 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:09,155 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:09,157 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:09,161 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:09,163 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:32:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:32:09,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:09,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:09,173 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:09,173 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(is_prime__#in~m) = 1*is_prime__#in~m Supporting invariants [] [2025-03-09 07:32:09,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:09,182 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:09,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:09,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:09,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:09,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:09,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:32:09,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:32:09,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 07:32:09,427 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2025-03-09 07:32:09,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16 Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 07:32:09,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 07:32:09,923 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 16. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 358 states and 527 transitions. Complement of second has 85 states. [2025-03-09 07:32:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:09,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 07:32:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 84 transitions. [2025-03-09 07:32:09,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 84 transitions. Stem has 4 letters. Loop has 24 letters. [2025-03-09 07:32:09,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:09,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 84 transitions. Stem has 28 letters. Loop has 24 letters. [2025-03-09 07:32:09,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:09,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 84 transitions. Stem has 4 letters. Loop has 48 letters. [2025-03-09 07:32:09,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:09,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 358 states and 527 transitions. [2025-03-09 07:32:09,936 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 30 [2025-03-09 07:32:09,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 358 states to 282 states and 403 transitions. [2025-03-09 07:32:09,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2025-03-09 07:32:09,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2025-03-09 07:32:09,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 403 transitions. [2025-03-09 07:32:09,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:09,943 INFO L218 hiAutomatonCegarLoop]: Abstraction has 282 states and 403 transitions. [2025-03-09 07:32:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 403 transitions. [2025-03-09 07:32:09,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 163. [2025-03-09 07:32:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 28 states have call successors, (28), 13 states have call predecessors, (28), 17 states have return successors, (37), 30 states have call predecessors, (37), 23 states have call successors, (37) [2025-03-09 07:32:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 220 transitions. [2025-03-09 07:32:09,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 220 transitions. [2025-03-09 07:32:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:09,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 07:32:09,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-09 07:32:09,962 INFO L87 Difference]: Start difference. First operand 163 states and 220 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 07:32:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:10,132 INFO L93 Difference]: Finished difference Result 185 states and 251 transitions. [2025-03-09 07:32:10,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 251 transitions. [2025-03-09 07:32:10,135 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-09 07:32:10,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 117 states and 160 transitions. [2025-03-09 07:32:10,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2025-03-09 07:32:10,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2025-03-09 07:32:10,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 160 transitions. [2025-03-09 07:32:10,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:10,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117 states and 160 transitions. [2025-03-09 07:32:10,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 160 transitions. [2025-03-09 07:32:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2025-03-09 07:32:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 71 states have internal predecessors, (93), 18 states have call successors, (18), 8 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 07:32:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2025-03-09 07:32:10,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-03-09 07:32:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:32:10,147 INFO L432 stractBuchiCegarLoop]: Abstraction has 93 states and 126 transitions. [2025-03-09 07:32:10,148 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:32:10,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 126 transitions. [2025-03-09 07:32:10,149 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 29 [2025-03-09 07:32:10,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:10,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:10,150 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:10,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:10,151 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-09 07:32:10,151 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret6 := multiple_of(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-09 07:32:10,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1797482131, now seen corresponding path program 1 times [2025-03-09 07:32:10,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:10,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214322331] [2025-03-09 07:32:10,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:10,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:10,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:32:10,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:32:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214322331] [2025-03-09 07:32:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214322331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:10,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:10,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:32:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133669872] [2025-03-09 07:32:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:10,192 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:32:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash 112979, now seen corresponding path program 1 times [2025-03-09 07:32:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763662148] [2025-03-09 07:32:10,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:10,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:10,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:10,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:10,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:10,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:10,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:10,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:10,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:10,259 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:10,259 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:10,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:10,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:10,260 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:10,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:10,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:10,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2025-03-09 07:32:10,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:10,260 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:10,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,309 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:10,309 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,312 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:32:10,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:10,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:10,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 07:32:10,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,341 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:32:10,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:10,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:10,478 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:10,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 07:32:10,484 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:10,484 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:10,484 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:10,484 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:10,484 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:10,484 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,484 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:10,484 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:10,484 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration4_Loop [2025-03-09 07:32:10,484 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:10,484 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:10,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,536 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:10,536 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:10,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,539 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:32:10,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:10,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:10,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:10,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:10,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:10,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:10,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:10,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:10,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:10,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:10,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,563 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:32:10,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:10,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:10,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:10,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:10,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:10,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:10,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:10,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:10,581 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:10,585 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:32:10,585 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:10,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,587 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:32:10,590 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:10,590 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:10,590 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:10,590 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_~m) = 1*multiple_of_~m Supporting invariants [] [2025-03-09 07:32:10,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 07:32:10,596 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:32:10,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:32:10,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:10,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:10,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:10,670 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 07:32:10,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 126 transitions. cyclomatic complexity: 36 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:10,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 126 transitions. cyclomatic complexity: 36. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 191 states and 253 transitions. Complement of second has 18 states. [2025-03-09 07:32:10,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-03-09 07:32:10,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 3 letters. [2025-03-09 07:32:10,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:10,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 15 letters. Loop has 3 letters. [2025-03-09 07:32:10,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:10,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 12 letters. Loop has 6 letters. [2025-03-09 07:32:10,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:10,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 253 transitions. [2025-03-09 07:32:10,717 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2025-03-09 07:32:10,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 137 states and 182 transitions. [2025-03-09 07:32:10,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-03-09 07:32:10,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-03-09 07:32:10,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 182 transitions. [2025-03-09 07:32:10,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:10,719 INFO L218 hiAutomatonCegarLoop]: Abstraction has 137 states and 182 transitions. [2025-03-09 07:32:10,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 182 transitions. [2025-03-09 07:32:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 108. [2025-03-09 07:32:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 84 states have internal predecessors, (106), 23 states have call successors, (25), 10 states have call predecessors, (25), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 07:32:10,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2025-03-09 07:32:10,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 146 transitions. [2025-03-09 07:32:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:10,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:32:10,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:32:10,723 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 5 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:10,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:10,751 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2025-03-09 07:32:10,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 128 transitions. [2025-03-09 07:32:10,752 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-09 07:32:10,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 128 transitions. [2025-03-09 07:32:10,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-09 07:32:10,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-09 07:32:10,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 128 transitions. [2025-03-09 07:32:10,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:10,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 98 states and 128 transitions. [2025-03-09 07:32:10,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 128 transitions. [2025-03-09 07:32:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2025-03-09 07:32:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.328358208955224) internal successors, (89), 70 states have internal predecessors, (89), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 07:32:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-03-09 07:32:10,760 INFO L240 hiAutomatonCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-09 07:32:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:32:10,764 INFO L432 stractBuchiCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-09 07:32:10,764 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:32:10,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 121 transitions. [2025-03-09 07:32:10,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-09 07:32:10,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:10,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:10,765 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:10,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:10,768 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume ~n <= 1;#res := 0;" "assume true;" >"#95#return;" "is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1;" "main_#t~ret13#1 := is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;havoc is_prime_#in~n#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;havoc main_#t~nondet14#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);havoc main_#t~nondet15#1;main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;" "assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1;" "assume main_#t~short17#1;" "call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);"< [2025-03-09 07:32:10,768 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2025-03-09 07:32:10,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765015, now seen corresponding path program 1 times [2025-03-09 07:32:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:10,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067171747] [2025-03-09 07:32:10,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:10,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:10,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:32:10,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:32:10,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067171747] [2025-03-09 07:32:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067171747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:10,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:10,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:32:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689310560] [2025-03-09 07:32:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:10,834 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:32:10,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,835 INFO L85 PathProgramCache]: Analyzing trace with hash 60571, now seen corresponding path program 1 times [2025-03-09 07:32:10,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:10,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581087505] [2025-03-09 07:32:10,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:10,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:10,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:10,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:10,837 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:10,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:10,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:10,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:10,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:10,866 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:10,866 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:10,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:10,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:10,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:10,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:10,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:10,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2025-03-09 07:32:10,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:10,866 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:10,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:10,909 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:10,909 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:10,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,911 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:32:10,914 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:10,914 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:10,926 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:10,927 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:10,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:10,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 07:32:10,939 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:10,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:10,951 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:10,951 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:10,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:10,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,959 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:32:10,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:10,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:10,973 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:10,973 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:10,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:10,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:10,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:10,984 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:10,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:32:10,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:10,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:10,997 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:10,998 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:11,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:11,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,005 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:32:11,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,017 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:11,017 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:11,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,025 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 07:32:11,026 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,036 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:11,036 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:11,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 07:32:11,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,044 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:32:11,045 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,045 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 07:32:11,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,063 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:32:11,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:11,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,103 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:11,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 07:32:11,108 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:11,108 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:11,108 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:11,108 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:11,108 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:11,108 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,108 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:11,108 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:11,108 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration5_Loop [2025-03-09 07:32:11,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:11,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:11,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,142 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:11,142 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:11,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,144 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:32:11,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,159 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 07:32:11,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,166 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 07:32:11,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 07:32:11,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,186 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:32:11,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,198 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:32:11,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,207 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:32:11,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 07:32:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,229 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:32:11,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 07:32:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,252 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:32:11,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:32:11,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,275 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 07:32:11,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:11,289 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:32:11,289 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:11,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,291 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 07:32:11,292 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:11,292 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:11,292 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:11,292 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2025-03-09 07:32:11,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 07:32:11,299 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:32:11,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:32:11,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:32:11,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:11,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:11,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:11,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:11,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:11,384 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-09 07:32:11,384 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 121 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:11,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 121 transitions. cyclomatic complexity: 32. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 114 states and 145 transitions. Complement of second has 14 states. [2025-03-09 07:32:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-03-09 07:32:11,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 3 letters. [2025-03-09 07:32:11,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-09 07:32:11,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 14 letters. Loop has 6 letters. [2025-03-09 07:32:11,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 145 transitions. [2025-03-09 07:32:11,452 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-09 07:32:11,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 106 states and 137 transitions. [2025-03-09 07:32:11,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-03-09 07:32:11,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2025-03-09 07:32:11,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 137 transitions. [2025-03-09 07:32:11,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,454 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 137 transitions. [2025-03-09 07:32:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 137 transitions. [2025-03-09 07:32:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2025-03-09 07:32:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 73 states have internal predecessors, (95), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 07:32:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-09 07:32:11,457 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-09 07:32:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:11,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:32:11,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:32:11,457 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:11,479 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2025-03-09 07:32:11,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 139 transitions. [2025-03-09 07:32:11,480 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-09 07:32:11,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 101 states and 131 transitions. [2025-03-09 07:32:11,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2025-03-09 07:32:11,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-03-09 07:32:11,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 131 transitions. [2025-03-09 07:32:11,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,482 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 131 transitions. [2025-03-09 07:32:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 131 transitions. [2025-03-09 07:32:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-09 07:32:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 73 states have internal predecessors, (93), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-03-09 07:32:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2025-03-09 07:32:11,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 126 transitions. [2025-03-09 07:32:11,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:32:11,489 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 126 transitions. [2025-03-09 07:32:11,489 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:32:11,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 126 transitions. [2025-03-09 07:32:11,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 28 [2025-03-09 07:32:11,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:11,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:11,490 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,490 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-09 07:32:11,490 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< [2025-03-09 07:32:11,490 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< [2025-03-09 07:32:11,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash 803476254, now seen corresponding path program 1 times [2025-03-09 07:32:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710847256] [2025-03-09 07:32:11,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:11,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:32:11,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:32:11,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:11,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:11,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710847256] [2025-03-09 07:32:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710847256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:32:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438454348] [2025-03-09 07:32:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:11,546 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:32:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1445738, now seen corresponding path program 1 times [2025-03-09 07:32:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128310424] [2025-03-09 07:32:11,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:11,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:11,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,548 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:11,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:11,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,583 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:11,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:11,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:11,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:11,583 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:11,583 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,583 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:11,583 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:11,583 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2025-03-09 07:32:11,583 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:11,583 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:11,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,621 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:11,621 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,623 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 07:32:11,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 07:32:11,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,642 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 07:32:11,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:11,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,681 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:11,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 07:32:11,685 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:11,685 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:11,685 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:11,685 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:11,686 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:11,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,686 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:11,686 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:11,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration6_Loop [2025-03-09 07:32:11,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:11,686 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:11,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,727 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:11,727 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:11,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,729 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 07:32:11,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:11,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:11,744 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:32:11,744 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,746 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 07:32:11,748 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:11,748 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:11,748 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:11,748 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = -1*multiple_of_#in~n Supporting invariants [] [2025-03-09 07:32:11,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:11,754 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:32:11,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:32:11,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:11,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:11,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:32:11,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:32:11,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:11,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:11,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:11,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 07:32:11,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:11,849 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-03-09 07:32:11,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 126 transitions. cyclomatic complexity: 33 Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:11,892 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 126 transitions. cyclomatic complexity: 33. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 200 states and 269 transitions. Complement of second has 17 states. [2025-03-09 07:32:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2025-03-09 07:32:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 14 letters. Loop has 4 letters. [2025-03-09 07:32:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 18 letters. Loop has 4 letters. [2025-03-09 07:32:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 14 letters. Loop has 8 letters. [2025-03-09 07:32:11,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 269 transitions. [2025-03-09 07:32:11,896 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2025-03-09 07:32:11,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 188 states and 257 transitions. [2025-03-09 07:32:11,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2025-03-09 07:32:11,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2025-03-09 07:32:11,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 257 transitions. [2025-03-09 07:32:11,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 188 states and 257 transitions. [2025-03-09 07:32:11,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 257 transitions. [2025-03-09 07:32:11,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2025-03-09 07:32:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 125 states have internal predecessors, (158), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (37), 21 states have call predecessors, (37), 22 states have call successors, (37) [2025-03-09 07:32:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2025-03-09 07:32:11,903 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163 states and 223 transitions. [2025-03-09 07:32:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:11,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:32:11,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:32:11,903 INFO L87 Difference]: Start difference. First operand 163 states and 223 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:11,965 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2025-03-09 07:32:11,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 171 states and 230 transitions. [2025-03-09 07:32:11,967 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-09 07:32:11,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 171 states to 171 states and 230 transitions. [2025-03-09 07:32:11,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2025-03-09 07:32:11,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2025-03-09 07:32:11,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 171 states and 230 transitions. [2025-03-09 07:32:11,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,969 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 230 transitions. [2025-03-09 07:32:11,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 230 transitions. [2025-03-09 07:32:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 165. [2025-03-09 07:32:11,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 127 states have internal predecessors, (157), 26 states have call successors, (26), 16 states have call predecessors, (26), 18 states have return successors, (40), 21 states have call predecessors, (40), 22 states have call successors, (40) [2025-03-09 07:32:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 223 transitions. [2025-03-09 07:32:11,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 223 transitions. [2025-03-09 07:32:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:32:11,975 INFO L432 stractBuchiCegarLoop]: Abstraction has 165 states and 223 transitions. [2025-03-09 07:32:11,975 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:32:11,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 223 transitions. [2025-03-09 07:32:11,976 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-09 07:32:11,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:11,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:11,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,976 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< [2025-03-09 07:32:11,976 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< [2025-03-09 07:32:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -953478147, now seen corresponding path program 1 times [2025-03-09 07:32:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331952152] [2025-03-09 07:32:11,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:32:11,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:32:11,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:32:11,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:32:11,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1389309257, now seen corresponding path program 1 times [2025-03-09 07:32:11,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130733981] [2025-03-09 07:32:11,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:11,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:11,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:11,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:11,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:11,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash -155036603, now seen corresponding path program 2 times [2025-03-09 07:32:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336334948] [2025-03-09 07:32:11,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 07:32:11,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:11,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:11,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:12,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:12,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:12,053 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:12,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:12,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:12,053 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:12,053 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:12,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,054 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:12,054 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:12,054 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2025-03-09 07:32:12,054 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:12,054 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:12,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,060 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,109 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:12,109 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:12,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,111 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 07:32:12,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,124 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,124 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#res=0} Honda state: {multiple_of_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,132 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 07:32:12,135 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,145 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,145 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~n=0} Honda state: {multiple_of_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-03-09 07:32:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,153 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 07:32:12,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,167 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,167 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_~m=0} Honda state: {multiple_of_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,175 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 07:32:12,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,177 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,188 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,189 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret8=0} Honda state: {multiple_of_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 07:32:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,196 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 07:32:12,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,211 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,211 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret7=0} Honda state: {multiple_of_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-03-09 07:32:12,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,219 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 07:32:12,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,231 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,231 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {multiple_of_#t~ret6=0} Honda state: {multiple_of_#t~ret6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,239 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 07:32:12,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 07:32:12,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,259 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 07:32:12,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:12,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,313 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:12,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 07:32:12,317 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:12,317 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:12,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:12,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:12,317 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:12,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:12,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:12,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration7_Loop [2025-03-09 07:32:12,317 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:12,317 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:12,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,369 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:12,370 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:12,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,372 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 07:32:12,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:12,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 07:32:12,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,392 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 07:32:12,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:12,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,415 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 07:32:12,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:12,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,438 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 07:32:12,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:12,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,461 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 07:32:12,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:12,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,484 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 07:32:12,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:12,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:12,503 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:12,503 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:32:12,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,505 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 07:32:12,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:12,509 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:12,509 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:12,509 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(multiple_of_#in~n) = 1*multiple_of_#in~n Supporting invariants [] [2025-03-09 07:32:12,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,516 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:32:12,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:32:12,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:12,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:12,624 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-03-09 07:32:12,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 223 transitions. cyclomatic complexity: 65 Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:12,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-03-09 07:32:12,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 223 transitions. cyclomatic complexity: 65. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 218 states and 293 transitions. Complement of second has 29 states. [2025-03-09 07:32:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2025-03-09 07:32:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-09 07:32:12,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:12,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 22 letters. Loop has 6 letters. [2025-03-09 07:32:12,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:12,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 12 letters. [2025-03-09 07:32:12,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:12,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 218 states and 293 transitions. [2025-03-09 07:32:12,753 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 48 [2025-03-09 07:32:12,756 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 218 states to 206 states and 279 transitions. [2025-03-09 07:32:12,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 183 [2025-03-09 07:32:12,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2025-03-09 07:32:12,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 206 states and 279 transitions. [2025-03-09 07:32:12,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:12,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 206 states and 279 transitions. [2025-03-09 07:32:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states and 279 transitions. [2025-03-09 07:32:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2025-03-09 07:32:12,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.291044776119403) internal successors, (173), 141 states have internal predecessors, (173), 28 states have call successors, (28), 18 states have call predecessors, (28), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2025-03-09 07:32:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 245 transitions. [2025-03-09 07:32:12,764 INFO L240 hiAutomatonCegarLoop]: Abstraction has 181 states and 245 transitions. [2025-03-09 07:32:12,764 INFO L432 stractBuchiCegarLoop]: Abstraction has 181 states and 245 transitions. [2025-03-09 07:32:12,764 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:32:12,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 245 transitions. [2025-03-09 07:32:12,766 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-09 07:32:12,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:12,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:12,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:12,767 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 07:32:12,767 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume 2 == ~n;#res := 1;" "assume true;" >"#95#return;" "is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1;" "main_#t~ret13#1 := is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;havoc is_prime_#in~n#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;havoc main_#t~nondet14#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);havoc main_#t~nondet15#1;main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;" "assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1;" "assume main_#t~short17#1;" "call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" [2025-03-09 07:32:12,767 INFO L754 eck$LassoCheckResult]: Loop: "assume !(0 == ~m);" "assume !(1 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" [2025-03-09 07:32:12,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1709161179, now seen corresponding path program 1 times [2025-03-09 07:32:12,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:12,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889134748] [2025-03-09 07:32:12,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:12,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:12,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:32:12,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:32:12,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:12,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:32:12,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:32:12,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash 52487928, now seen corresponding path program 1 times [2025-03-09 07:32:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419585540] [2025-03-09 07:32:12,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:12,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:32:12,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:32:12,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:12,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:32:12,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:32:12,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:12,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1194182572, now seen corresponding path program 1 times [2025-03-09 07:32:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:12,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405193073] [2025-03-09 07:32:12,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:12,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:12,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:12,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:12,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:12,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:12,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:12,871 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:12,871 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:12,871 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:12,871 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:12,871 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:12,871 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,871 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:12,871 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:12,871 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2025-03-09 07:32:12,871 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:12,871 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:12,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:12,929 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:12,929 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:12,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,931 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 07:32:12,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,943 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:12,943 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:12,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 07:32:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,951 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 07:32:12,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:12,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:12,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-09 07:32:12,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,977 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 07:32:12,979 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:12,979 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:13,058 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:13,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:13,064 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:13,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:13,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:13,064 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:13,064 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:13,064 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:13,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:13,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration8_Loop [2025-03-09 07:32:13,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:13,064 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:13,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,111 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:13,111 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:13,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,113 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 07:32:13,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:13,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:13,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:13,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:13,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:13,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:13,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:13,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:13,125 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:13,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 07:32:13,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,132 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 07:32:13,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:13,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:13,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:13,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:13,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:13,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:13,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:13,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:13,147 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:13,148 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:13,149 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-03-09 07:32:13,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,151 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 07:32:13,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:13,153 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:13,153 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:13,153 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2025-03-09 07:32:13,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 07:32:13,159 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:13,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 07:32:13,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 07:32:13,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:32:13,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 07:32:13,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 07:32:13,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:32:13,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:13,312 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2025-03-09 07:32:13,312 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 245 transitions. cyclomatic complexity: 72 Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:13,447 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 245 transitions. cyclomatic complexity: 72. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 205 states and 272 transitions. Complement of second has 25 states. [2025-03-09 07:32:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2025-03-09 07:32:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 17 letters. Loop has 5 letters. [2025-03-09 07:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 22 letters. Loop has 5 letters. [2025-03-09 07:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 52 transitions. Stem has 17 letters. Loop has 10 letters. [2025-03-09 07:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 272 transitions. [2025-03-09 07:32:13,455 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-09 07:32:13,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 204 states and 271 transitions. [2025-03-09 07:32:13,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2025-03-09 07:32:13,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 180 [2025-03-09 07:32:13,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 271 transitions. [2025-03-09 07:32:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:13,457 INFO L218 hiAutomatonCegarLoop]: Abstraction has 204 states and 271 transitions. [2025-03-09 07:32:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 271 transitions. [2025-03-09 07:32:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 191. [2025-03-09 07:32:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 142 states have (on average 1.2887323943661972) internal successors, (183), 149 states have internal predecessors, (183), 30 states have call successors, (30), 20 states have call predecessors, (30), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2025-03-09 07:32:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 257 transitions. [2025-03-09 07:32:13,462 INFO L240 hiAutomatonCegarLoop]: Abstraction has 191 states and 257 transitions. [2025-03-09 07:32:13,462 INFO L432 stractBuchiCegarLoop]: Abstraction has 191 states and 257 transitions. [2025-03-09 07:32:13,462 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:32:13,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 257 transitions. [2025-03-09 07:32:13,463 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-09 07:32:13,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:13,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:13,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:13,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:13,464 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume 2 == ~n;#res := 1;" "assume true;" >"#95#return;" "is_prime_#res#1 := is_prime_#t~ret9#1;havoc is_prime_#t~ret9#1;" "main_#t~ret13#1 := is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;havoc is_prime_#in~n#1;assume { :end_inline_is_prime } true;main_~result~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;havoc main_#t~nondet14#1;main_~f1~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;" "assume !(main_~f1~0#1 < 1 || main_~f1~0#1 > 46340);havoc main_#t~nondet15#1;main_~f2~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;" "assume !(main_~f2~0#1 < 1 || main_~f2~0#1 > 46340);main_#t~short17#1 := 1 == main_~result~0#1;" "assume main_#t~short17#1;" "call main_#t~ret16#1 := mult(main_~f1~0#1, main_~f2~0#1);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(0 == ~m);" "assume !(1 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-09 07:32:13,464 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret4 := mult(~n, -~m);"< "~n := #in~n;~m := #in~m;" "assume ~m < 0;" [2025-03-09 07:32:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1194182573, now seen corresponding path program 1 times [2025-03-09 07:32:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872650812] [2025-03-09 07:32:13,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:13,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:13,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:13,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 07:32:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872650812] [2025-03-09 07:32:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872650812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:13,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:32:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161631975] [2025-03-09 07:32:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:13,507 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:32:13,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:13,507 INFO L85 PathProgramCache]: Analyzing trace with hash 117271, now seen corresponding path program 2 times [2025-03-09 07:32:13,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:13,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628558490] [2025-03-09 07:32:13,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:13,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:13,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:13,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:13,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:32:13,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:13,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:13,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:13,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:13,562 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:13,562 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:13,562 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:13,562 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:13,563 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:13,563 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,563 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:13,563 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:13,563 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2025-03-09 07:32:13,563 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:13,563 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:13,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,603 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:13,603 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:13,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,605 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 07:32:13,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:13,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:13,626 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:13,626 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=-6, mult_#in~n=-6} Honda state: {mult_~n=-6, mult_#in~n=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:13,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:13,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,634 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 07:32:13,637 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:13,637 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:13,647 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:13,647 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:13,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:13,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,655 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 07:32:13,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:13,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:13,669 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:13,670 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:13,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,678 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 07:32:13,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:13,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:13,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:13,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,707 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 07:32:13,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:13,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:13,846 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:13,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2025-03-09 07:32:13,852 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:13,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:13,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:13,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:13,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:13,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:13,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:13,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: Primes.c_Iteration9_Loop [2025-03-09 07:32:13,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:13,853 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:13,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:13,892 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:13,892 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:13,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,894 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 07:32:13,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:13,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:13,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:13,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:13,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:13,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:13,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:13,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:13,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:13,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-03-09 07:32:13,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,914 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 07:32:13,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:13,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:13,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:13,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:13,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:13,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:13,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:13,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:13,928 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:13,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 07:32:13,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,935 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 07:32:13,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:13,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:13,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:13,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:13,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:13,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:13,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:13,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:13,947 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:13,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-09 07:32:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,954 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 07:32:13,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:32:13,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:13,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:13,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:13,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:13,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:13,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:13,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:13,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:13,969 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-03-09 07:32:13,969 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:13,971 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-03-09 07:32:13,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:13,973 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:13,973 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:13,973 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_~m) = 1*mult_~m Supporting invariants [] [2025-03-09 07:32:13,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-03-09 07:32:13,979 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:13,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:13,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:14,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:14,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:14,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:14,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:14,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:14,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:14,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:14,090 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-03-09 07:32:14,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 191 states and 257 transitions. cyclomatic complexity: 75 Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:14,141 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 191 states and 257 transitions. cyclomatic complexity: 75. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 232 states and 303 transitions. Complement of second has 11 states. [2025-03-09 07:32:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-03-09 07:32:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:14,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-03-09 07:32:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 3 letters. [2025-03-09 07:32:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:14,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-09 07:32:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:14,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 22 letters. Loop has 6 letters. [2025-03-09 07:32:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:14,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 303 transitions. [2025-03-09 07:32:14,147 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 42 [2025-03-09 07:32:14,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 222 states and 293 transitions. [2025-03-09 07:32:14,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2025-03-09 07:32:14,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2025-03-09 07:32:14,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 293 transitions. [2025-03-09 07:32:14,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:14,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 222 states and 293 transitions. [2025-03-09 07:32:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 293 transitions. [2025-03-09 07:32:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2025-03-09 07:32:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 34 states have call successors, (37), 25 states have call predecessors, (37), 19 states have return successors, (44), 21 states have call predecessors, (44), 23 states have call successors, (44) [2025-03-09 07:32:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 279 transitions. [2025-03-09 07:32:14,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209 states and 279 transitions. [2025-03-09 07:32:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:14,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:32:14,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 07:32:14,154 INFO L87 Difference]: Start difference. First operand 209 states and 279 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 07:32:14,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:14,177 INFO L93 Difference]: Finished difference Result 205 states and 270 transitions. [2025-03-09 07:32:14,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 270 transitions. [2025-03-09 07:32:14,179 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-09 07:32:14,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 145 states and 177 transitions. [2025-03-09 07:32:14,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2025-03-09 07:32:14,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2025-03-09 07:32:14,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 177 transitions. [2025-03-09 07:32:14,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:14,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 177 transitions. [2025-03-09 07:32:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 177 transitions. [2025-03-09 07:32:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2025-03-09 07:32:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 100 states have internal predecessors, (108), 18 states have call successors, (18), 13 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 14 states have call successors, (28) [2025-03-09 07:32:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2025-03-09 07:32:14,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 154 transitions. [2025-03-09 07:32:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:32:14,186 INFO L432 stractBuchiCegarLoop]: Abstraction has 125 states and 154 transitions. [2025-03-09 07:32:14,186 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:32:14,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 154 transitions. [2025-03-09 07:32:14,186 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-09 07:32:14,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:14,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:14,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:14,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:14,187 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-09 07:32:14,187 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-09 07:32:14,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash -249976348, now seen corresponding path program 1 times [2025-03-09 07:32:14,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:14,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766549853] [2025-03-09 07:32:14,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:14,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:14,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:32:14,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:32:14,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:14,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766549853] [2025-03-09 07:32:14,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766549853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:32:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139514668] [2025-03-09 07:32:14,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:14,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:32:14,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:14,245 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:32:14,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-03-09 07:32:14,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 07:32:14,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 07:32:14,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:14,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 07:32:14,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:14,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:32:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:14,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139514668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:32:14,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:32:14,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-09 07:32:14,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403621365] [2025-03-09 07:32:14,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:32:14,379 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:32:14,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -866811920, now seen corresponding path program 1 times [2025-03-09 07:32:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307240053] [2025-03-09 07:32:14,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:14,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-03-09 07:32:14,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:14,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:14,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:14,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:14,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:14,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:14,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 07:32:14,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-09 07:32:14,535 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. cyclomatic complexity: 35 Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:32:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:14,647 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2025-03-09 07:32:14,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2025-03-09 07:32:14,649 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-09 07:32:14,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 147 states and 186 transitions. [2025-03-09 07:32:14,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2025-03-09 07:32:14,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2025-03-09 07:32:14,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 186 transitions. [2025-03-09 07:32:14,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:14,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 186 transitions. [2025-03-09 07:32:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 186 transitions. [2025-03-09 07:32:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2025-03-09 07:32:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.1090909090909091) internal successors, (122), 114 states have internal predecessors, (122), 20 states have call successors, (20), 15 states have call predecessors, (20), 13 states have return successors, (31), 13 states have call predecessors, (31), 17 states have call successors, (31) [2025-03-09 07:32:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 173 transitions. [2025-03-09 07:32:14,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 143 states and 173 transitions. [2025-03-09 07:32:14,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 07:32:14,655 INFO L432 stractBuchiCegarLoop]: Abstraction has 143 states and 173 transitions. [2025-03-09 07:32:14,655 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:32:14,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 173 transitions. [2025-03-09 07:32:14,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 36 [2025-03-09 07:32:14,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:14,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:14,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:14,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:14,657 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1, main_#t~short17#1, main_~n~0#1, main_~result~0#1, main_~f1~0#1, main_~f2~0#1;havoc main_#t~nondet12#1;main_~n~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;" "assume !(main_~n~0#1 < 1 || main_~n~0#1 > 46340);assume { :begin_inline_is_prime } true;is_prime_#in~n#1 := main_~n~0#1;havoc is_prime_#res#1;havoc is_prime_#t~ret9#1, is_prime_~n#1;is_prime_~n#1 := is_prime_#in~n#1;" "call is_prime_#t~ret9#1 := is_prime_(is_prime_~n#1, is_prime_~n#1 - 1);"< "~n := #in~n;~m := #in~m;" "assume !(~n <= 1);" "assume !(2 == ~n);" "assume ~n > 2;" "assume !(~m <= 1);" "call #t~ret10 := multiple_of(~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-09 07:32:14,657 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret8 := multiple_of(~n - ~m, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume ~n < 0;" "call #t~ret7 := multiple_of(-~n, ~m);"< "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(~n < 0);" "assume !(0 == ~m);" "assume !(0 == ~n);" [2025-03-09 07:32:14,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1817328284, now seen corresponding path program 2 times [2025-03-09 07:32:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:14,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537383589] [2025-03-09 07:32:14,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:14,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 07:32:14,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:32:14,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:14,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,664 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:14,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:32:14,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:32:14,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:14,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:14,674 INFO L85 PathProgramCache]: Analyzing trace with hash -866811920, now seen corresponding path program 2 times [2025-03-09 07:32:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:14,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639644374] [2025-03-09 07:32:14,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:14,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-09 07:32:14,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:14,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:14,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:14,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:14,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:14,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:14,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1897886923, now seen corresponding path program 3 times [2025-03-09 07:32:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342896413] [2025-03-09 07:32:14,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:14,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 5 equivalence classes. [2025-03-09 07:32:14,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:32:14,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 07:32:14,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,696 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:14,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 07:32:14,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:32:14,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:14,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:14,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:15,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:32:15,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:32:15,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:15,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:15,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:15,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 07:32:15,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 07:32:15,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:15,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:15,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:32:15 BoogieIcfgContainer [2025-03-09 07:32:15,482 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:32:15,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:32:15,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:32:15,482 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:32:15,483 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:07" (3/4) ... [2025-03-09 07:32:15,485 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-09 07:32:15,514 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 07:32:15,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:32:15,515 INFO L158 Benchmark]: Toolchain (without parser) took 8997.92ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 39.6MB in the end (delta: 67.1MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2025-03-09 07:32:15,515 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:15,515 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.81ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:32:15,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.96ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 907.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:15,516 INFO L158 Benchmark]: Boogie Preprocessor took 17.88ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:32:15,516 INFO L158 Benchmark]: IcfgBuilder took 285.60ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 79.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:32:15,516 INFO L158 Benchmark]: BuchiAutomizer took 8462.61ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 43.7MB in the end (delta: 35.3MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2025-03-09 07:32:15,516 INFO L158 Benchmark]: Witness Printer took 32.36ms. Allocated memory is still 142.6MB. Free memory was 43.7MB in the beginning and 39.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:15,517 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.81ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.7MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.96ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.8MB in the end (delta: 907.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.88ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 92.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 285.60ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 79.9MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8462.61ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 43.7MB in the end (delta: 35.3MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * Witness Printer took 32.36ms. Allocated memory is still 142.6MB. Free memory was 43.7MB in the beginning and 39.6MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (8 trivial, 7 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(m) and consists of 15 locations. One deterministic module has affine ranking function m and consists of 5 locations. One deterministic module has affine ranking function ((long long) -1 * \old(m)) and consists of 5 locations. One deterministic module has affine ranking function ((long long) -1 * \old(n)) and consists of 5 locations. One deterministic module has affine ranking function \old(n) and consists of 8 locations. One deterministic module has affine ranking function m and consists of 8 locations. One deterministic module has affine ranking function m and consists of 5 locations. 8 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 143 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 5.6s. Construction of modules took 0.7s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 11. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 303 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/7 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 632 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 608 mSDsluCounter, 2124 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1458 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1101 IncrementalHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 666 mSDtfsCounter, 1101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT1 SILN1 SILU0 SILI0 SILT4 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf93 smp89 dnf100 smp100 tf109 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 19 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 44]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L77] int n = __VERIFIER_nondet_int(); [L78] COND FALSE !(n < 1 || n > 46340) [L83] CALL is_prime(n) [L53] CALL is_prime_(n, n - 1) VAL [\old(m)=2, \old(n)=3] [L58] COND FALSE !(n <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L61] COND FALSE !(n == 2) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L64] COND TRUE n > 2 VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L65] COND FALSE !(m <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L68] CALL multiple_of(n, m) VAL [\old(m)=2, \old(n)=3] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=-1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L35] COND TRUE n < 0 VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L36] CALL multiple_of(-n, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] Loop: [L44] CALL multiple_of(n - m, m) [L32] COND FALSE !(m < 0) [L35] COND TRUE n < 0 [L36] CALL multiple_of(-n, m) [L32] COND FALSE !(m < 0) [L35] COND FALSE !(n < 0) [L38] COND FALSE !(m == 0) [L41] COND FALSE !(n == 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L77] int n = __VERIFIER_nondet_int(); [L78] COND FALSE !(n < 1 || n > 46340) [L83] CALL is_prime(n) [L53] CALL is_prime_(n, n - 1) VAL [\old(m)=2, \old(n)=3] [L58] COND FALSE !(n <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L61] COND FALSE !(n == 2) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L64] COND TRUE n > 2 VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L65] COND FALSE !(m <= 1) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L68] CALL multiple_of(n, m) VAL [\old(m)=2, \old(n)=3] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=3, m=2, n=3] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L44] CALL multiple_of(n - m, m) VAL [\old(m)=2, \old(n)=-1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L35] COND TRUE n < 0 VAL [\old(m)=2, \old(n)=-1, m=2, n=-1] [L36] CALL multiple_of(-n, m) VAL [\old(m)=2, \old(n)=1] [L32] COND FALSE !(m < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L35] COND FALSE !(n < 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L38] COND FALSE !(m == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] [L41] COND FALSE !(n == 0) VAL [\old(m)=2, \old(n)=1, m=2, n=1] Loop: [L44] CALL multiple_of(n - m, m) [L32] COND FALSE !(m < 0) [L35] COND TRUE n < 0 [L36] CALL multiple_of(-n, m) [L32] COND FALSE !(m < 0) [L35] COND FALSE !(n < 0) [L38] COND FALSE !(m == 0) [L41] COND FALSE !(n == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-09 07:32:15,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-03-09 07:32:15,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 07:32:15,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)