./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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/loop-simple/deep-nested.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 f4fa4f6a03e1cc5362361e8e2a443a39504511936859bef102e6d3337f038be8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 14:47:08,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 14:47:09,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 14:47:09,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 14:47:09,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 14:47:09,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 14:47:09,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 14:47:09,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 14:47:09,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 14:47:09,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 14:47:09,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 14:47:09,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 14:47:09,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 14:47:09,095 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 14:47:09,095 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 14:47:09,095 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 14:47:09,096 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 14:47:09,096 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 14:47:09,096 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 14:47:09,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 14:47:09,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 14:47:09,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 14:47:09,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 14:47:09,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 14:47:09,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 14:47:09,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 14:47:09,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 14:47:09,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 14:47:09,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 14:47:09,104 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 14:47:09,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 14:47:09,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 14:47:09,104 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 14:47:09,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 14:47:09,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 14:47:09,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 14:47:09,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 14:47:09,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 14:47:09,110 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 14:47:09,111 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> f4fa4f6a03e1cc5362361e8e2a443a39504511936859bef102e6d3337f038be8 [2024-11-19 14:47:09,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 14:47:09,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 14:47:09,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 14:47:09,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 14:47:09,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 14:47:09,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/deep-nested.c [2024-11-19 14:47:10,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 14:47:11,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 14:47:11,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-simple/deep-nested.c [2024-11-19 14:47:11,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7062d5097/8adabf3d395e46a0950ae1236976ba40/FLAG92c728a36 [2024-11-19 14:47:11,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7062d5097/8adabf3d395e46a0950ae1236976ba40 [2024-11-19 14:47:11,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 14:47:11,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 14:47:11,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 14:47:11,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 14:47:11,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 14:47:11,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794bfe1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11, skipping insertion in model container [2024-11-19 14:47:11,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 14:47:11,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:47:11,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 14:47:11,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 14:47:11,791 INFO L204 MainTranslator]: Completed translation [2024-11-19 14:47:11,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11 WrapperNode [2024-11-19 14:47:11,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 14:47:11,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 14:47:11,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 14:47:11,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 14:47:11,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,825 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-19 14:47:11,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 14:47:11,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 14:47:11,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 14:47:11,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 14:47:11,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,839 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,849 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]. [2024-11-19 14:47:11,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 14:47:11,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 14:47:11,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 14:47:11,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 14:47:11,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (1/1) ... [2024-11-19 14:47:11,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 14:47:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:11,909 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) [2024-11-19 14:47:11,913 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 [2024-11-19 14:47:11,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 14:47:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 14:47:11,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 14:47:11,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 14:47:12,032 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 14:47:12,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 14:47:12,184 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 14:47:12,184 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 14:47:12,202 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 14:47:12,202 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 14:47:12,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:12 BoogieIcfgContainer [2024-11-19 14:47:12,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 14:47:12,203 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 14:47:12,204 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 14:47:12,210 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 14:47:12,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:12,211 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 02:47:11" (1/3) ... [2024-11-19 14:47:12,212 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39b1f009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:47:12, skipping insertion in model container [2024-11-19 14:47:12,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:12,214 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 02:47:11" (2/3) ... [2024-11-19 14:47:12,215 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39b1f009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 02:47:12, skipping insertion in model container [2024-11-19 14:47:12,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 14:47:12,215 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 02:47:12" (3/3) ... [2024-11-19 14:47:12,218 INFO L332 chiAutomizerObserver]: Analyzing ICFG deep-nested.c [2024-11-19 14:47:12,267 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 14:47:12,267 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 14:47:12,267 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 14:47:12,267 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 14:47:12,268 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 14:47:12,268 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 14:47:12,268 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 14:47:12,268 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 14:47:12,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:12,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:47:12,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:12,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:12,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:12,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:47:12,295 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 14:47:12,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:12,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:47:12,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:12,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:12,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:12,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 14:47:12,307 INFO L745 eck$LassoCheckResult]: Stem: 16#$Ultimate##0true 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(14, 2);call #Ultimate.allocInit(12, 3); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 6#L17-3true [2024-11-19 14:47:12,308 INFO L747 eck$LassoCheckResult]: Loop: 6#L17-3true assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 13#L18-3true assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 9#L17-2true main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 6#L17-3true [2024-11-19 14:47:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-19 14:47:12,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11528697] [2024-11-19 14:47:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:12,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:12,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 39964, now seen corresponding path program 1 times [2024-11-19 14:47:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684943068] [2024-11-19 14:47:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:12,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684943068] [2024-11-19 14:47:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684943068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:12,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:12,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 14:47:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620690459] [2024-11-19 14:47:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:12,691 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 14:47:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 14:47:12,729 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:12,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:12,794 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-11-19 14:47:12,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2024-11-19 14:47:12,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2024-11-19 14:47:12,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 29 transitions. [2024-11-19 14:47:12,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 14:47:12,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 14:47:12,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2024-11-19 14:47:12,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:12,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-11-19 14:47:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2024-11-19 14:47:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2024-11-19 14:47:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-11-19 14:47:12,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-19 14:47:12,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 14:47:12,838 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-11-19 14:47:12,839 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 14:47:12,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-11-19 14:47:12,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-19 14:47:12,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:12,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:12,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:12,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-11-19 14:47:12,842 INFO L745 eck$LassoCheckResult]: Stem: 66#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3); 58#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 59#L17-3 [2024-11-19 14:47:12,842 INFO L747 eck$LassoCheckResult]: Loop: 59#L17-3 assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 60#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 54#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 63#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 64#L18-3 assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 61#L17-2 main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 59#L17-3 [2024-11-19 14:47:12,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-11-19 14:47:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:12,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892032991] [2024-11-19 14:47:12,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:12,859 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:12,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:12,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:12,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:12,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1191194659, now seen corresponding path program 1 times [2024-11-19 14:47:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942417084] [2024-11-19 14:47:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942417084] [2024-11-19 14:47:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942417084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:13,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:13,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:47:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159321978] [2024-11-19 14:47:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:13,013 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:47:13,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:47:13,015 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:13,070 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2024-11-19 14:47:13,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2024-11-19 14:47:13,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-19 14:47:13,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2024-11-19 14:47:13,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2024-11-19 14:47:13,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2024-11-19 14:47:13,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-11-19 14:47:13,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:13,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-19 14:47:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-11-19 14:47:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2024-11-19 14:47:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-11-19 14:47:13,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-19 14:47:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:47:13,078 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-11-19 14:47:13,078 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 14:47:13,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2024-11-19 14:47:13,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-19 14:47:13,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:13,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:13,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:13,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:13,081 INFO L745 eck$LassoCheckResult]: Stem: 109#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3); 100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 101#L17-3 [2024-11-19 14:47:13,082 INFO L747 eck$LassoCheckResult]: Loop: 101#L17-3 assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 102#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 107#L19-3 assume !!(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~d~0#1 := 0; 108#L20-3 assume !(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 95#L19-2 main_#t~pre6#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre6#1; 96#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 105#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 106#L18-3 assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 104#L17-2 main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 101#L17-3 [2024-11-19 14:47:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-11-19 14:47:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793525637] [2024-11-19 14:47:13,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:13,094 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 14:47:13,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:13,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:13,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:13,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1508685402, now seen corresponding path program 1 times [2024-11-19 14:47:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655258041] [2024-11-19 14:47:13,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:13,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:13,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:13,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655258041] [2024-11-19 14:47:13,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655258041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:13,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:13,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:47:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529864965] [2024-11-19 14:47:13,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:13,242 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:13,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:13,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:47:13,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:47:13,243 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:13,291 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2024-11-19 14:47:13,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2024-11-19 14:47:13,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-19 14:47:13,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2024-11-19 14:47:13,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2024-11-19 14:47:13,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-11-19 14:47:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2024-11-19 14:47:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:13,295 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-19 14:47:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2024-11-19 14:47:13,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2024-11-19 14:47:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-11-19 14:47:13,299 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:47:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:47:13,300 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-11-19 14:47:13,301 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 14:47:13,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2024-11-19 14:47:13,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2024-11-19 14:47:13,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:13,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:13,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:13,304 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:13,304 INFO L745 eck$LassoCheckResult]: Stem: 152#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3); 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 143#L17-3 [2024-11-19 14:47:13,304 INFO L747 eck$LassoCheckResult]: Loop: 143#L17-3 assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 144#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 150#L19-3 assume !!(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~d~0#1 := 0; 151#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 139#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 140#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 149#L20-3 assume !(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 137#L19-2 main_#t~pre6#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre6#1; 138#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 147#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 148#L18-3 assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 146#L17-2 main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 143#L17-3 [2024-11-19 14:47:13,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-11-19 14:47:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872663894] [2024-11-19 14:47:13,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 14:47:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:13,313 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 14:47:13,313 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:13,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:13,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:13,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 111172885, now seen corresponding path program 1 times [2024-11-19 14:47:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467445984] [2024-11-19 14:47:13,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467445984] [2024-11-19 14:47:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467445984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 14:47:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 14:47:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 14:47:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845080668] [2024-11-19 14:47:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 14:47:13,468 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 14:47:13,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 14:47:13,469 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:13,513 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-11-19 14:47:13,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. [2024-11-19 14:47:13,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2024-11-19 14:47:13,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 23 transitions. [2024-11-19 14:47:13,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-19 14:47:13,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-19 14:47:13,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2024-11-19 14:47:13,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:13,518 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-19 14:47:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2024-11-19 14:47:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2024-11-19 14:47:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-19 14:47:13,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-19 14:47:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 14:47:13,522 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-19 14:47:13,523 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 14:47:13,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2024-11-19 14:47:13,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-19 14:47:13,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:13,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:13,525 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:13,525 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:13,525 INFO L745 eck$LassoCheckResult]: Stem: 194#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3); 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 184#L17-3 [2024-11-19 14:47:13,526 INFO L747 eck$LassoCheckResult]: Loop: 184#L17-3 assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 185#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 190#L19-3 assume !!(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~d~0#1 := 0; 191#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 181#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 182#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 186#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 195#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 192#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 193#L20-3 assume !(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 179#L19-2 main_#t~pre6#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre6#1; 180#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 188#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 189#L18-3 assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 187#L17-2 main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 184#L17-3 [2024-11-19 14:47:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-11-19 14:47:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:13,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912172398] [2024-11-19 14:47:13,528 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 14:47:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:13,534 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 14:47:13,535 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:13,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:13,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:13,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 275053855, now seen corresponding path program 1 times [2024-11-19 14:47:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:13,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760056924] [2024-11-19 14:47:13,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:15,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760056924] [2024-11-19 14:47:15,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760056924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:15,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265284223] [2024-11-19 14:47:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 14:47:15,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:15,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:15,545 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) [2024-11-19 14:47:15,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 14:47:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 14:47:15,600 WARN L253 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 14:47:15,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:15,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265284223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:16,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-19 14:47:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085003172] [2024-11-19 14:47:16,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:16,380 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:16,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:16,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 14:47:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2024-11-19 14:47:16,383 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. cyclomatic complexity: 5 Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:18,838 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2024-11-19 14:47:18,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 96 transitions. [2024-11-19 14:47:18,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2024-11-19 14:47:18,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 96 transitions. [2024-11-19 14:47:18,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2024-11-19 14:47:18,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-19 14:47:18,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 96 transitions. [2024-11-19 14:47:18,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:18,844 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 96 transitions. [2024-11-19 14:47:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 96 transitions. [2024-11-19 14:47:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 43. [2024-11-19 14:47:18,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2024-11-19 14:47:18,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-19 14:47:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-19 14:47:18,850 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2024-11-19 14:47:18,850 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 14:47:18,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2024-11-19 14:47:18,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2024-11-19 14:47:18,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:18,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:18,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:18,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 14:47:18,854 INFO L745 eck$LassoCheckResult]: Stem: 432#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3); 420#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 421#L17-3 [2024-11-19 14:47:18,855 INFO L747 eck$LassoCheckResult]: Loop: 421#L17-3 assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 422#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 431#L19-3 assume !!(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~d~0#1 := 0; 434#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 443#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 442#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 433#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 418#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 419#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 423#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 440#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 441#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 447#L20-3 assume !(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 446#L19-2 main_#t~pre6#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre6#1; 437#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 438#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 435#L18-3 assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 424#L17-2 main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 421#L17-3 [2024-11-19 14:47:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-11-19 14:47:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735724391] [2024-11-19 14:47:18,855 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 14:47:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,861 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 14:47:18,861 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 14:47:18,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:18,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -924784427, now seen corresponding path program 2 times [2024-11-19 14:47:18,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889763112] [2024-11-19 14:47:18,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:18,887 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:18,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889763112] [2024-11-19 14:47:19,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889763112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:19,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793989296] [2024-11-19 14:47:19,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 14:47:19,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:19,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:19,094 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:19,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 14:47:19,135 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 14:47:19,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:19,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:47:19,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:19,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 14:47:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793989296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:19,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-11-19 14:47:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408692084] [2024-11-19 14:47:19,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:19,489 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:19,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 14:47:19,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-19 14:47:19,497 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. cyclomatic complexity: 11 Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 14:47:20,992 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2024-11-19 14:47:20,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 235 transitions. [2024-11-19 14:47:20,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 196 [2024-11-19 14:47:20,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 235 transitions. [2024-11-19 14:47:20,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2024-11-19 14:47:20,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2024-11-19 14:47:20,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 235 transitions. [2024-11-19 14:47:20,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 14:47:20,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 235 transitions. [2024-11-19 14:47:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 235 transitions. [2024-11-19 14:47:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2024-11-19 14:47:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.2014925373134329) internal successors, (161), 133 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2024-11-19 14:47:21,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 161 transitions. [2024-11-19 14:47:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-19 14:47:21,009 INFO L425 stractBuchiCegarLoop]: Abstraction has 134 states and 161 transitions. [2024-11-19 14:47:21,009 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 14:47:21,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 161 transitions. [2024-11-19 14:47:21,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 132 [2024-11-19 14:47:21,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 14:47:21,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 14:47:21,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-19 14:47:21,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-11-19 14:47:21,012 INFO L745 eck$LassoCheckResult]: Stem: 872#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3); 860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_#t~pre7#1, main_#t~pre8#1, main_~a~0#1, main_~b~0#1, main_~c~0#1, main_~d~0#1, main_~e~0#1, main_~uint32_max~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~c~0#1;havoc main_~d~0#1;havoc main_~e~0#1;havoc main_~uint32_max~0#1;main_~uint32_max~0#1 := 4294967295;main_~a~0#1 := 0; 861#L17-3 [2024-11-19 14:47:21,012 INFO L747 eck$LassoCheckResult]: Loop: 861#L17-3 assume !!(main_~a~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~b~0#1 := 0; 862#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 874#L19-3 assume !!(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~d~0#1 := 0; 875#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 989#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 987#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 986#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 985#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 981#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 984#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 980#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 870#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 871#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 916#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 988#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 873#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 858#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 859#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 863#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 918#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 917#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 915#L20-3 assume !(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 856#L19-2 main_#t~pre6#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre6#1; 857#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 865#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 866#L18-3 assume !!(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~c~0#1 := 0; 867#L19-3 assume !!(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~d~0#1 := 0; 949#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 948#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 947#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 946#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 945#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 944#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 943#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 941#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 940#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 939#L20-3 assume !!(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296);main_~e~0#1 := 0; 914#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 935#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 930#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 931#L21-3 assume !!(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 901#L22 assume !((((main_~a~0#1 % 4294967296 == main_~b~0#1 % 4294967296 && main_~b~0#1 % 4294967296 == main_~c~0#1 % 4294967296) && main_~c~0#1 % 4294967296 == main_~d~0#1 % 4294967296) && main_~d~0#1 % 4294967296 == main_~e~0#1 % 4294967296) && main_~e~0#1 % 4294967296 == (main_~uint32_max~0#1 - 2) % 4294967296); 902#L21-2 main_#t~pre4#1 := 1 + main_~e~0#1;main_~e~0#1 := 1 + main_~e~0#1;havoc main_#t~pre4#1; 905#L21-3 assume !(main_~e~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 906#L20-2 main_#t~pre5#1 := 1 + main_~d~0#1;main_~d~0#1 := 1 + main_~d~0#1;havoc main_#t~pre5#1; 913#L20-3 assume !(main_~d~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 912#L19-2 main_#t~pre6#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre6#1; 879#L19-3 assume !(main_~c~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 878#L18-2 main_#t~pre7#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre7#1; 876#L18-3 assume !(main_~b~0#1 % 4294967296 < (main_~uint32_max~0#1 - 1) % 4294967296); 864#L17-2 main_#t~pre8#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre8#1; 861#L17-3 [2024-11-19 14:47:21,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,013 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-11-19 14:47:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968408022] [2024-11-19 14:47:21,013 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 14:47:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 14:47:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 14:47:21,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 14:47:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 14:47:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash 411902704, now seen corresponding path program 3 times [2024-11-19 14:47:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 14:47:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612560511] [2024-11-19 14:47:21,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 14:47:21,208 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-19 14:47:21,209 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 38 proven. 102 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 14:47:23,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 14:47:23,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612560511] [2024-11-19 14:47:23,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612560511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 14:47:23,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640906250] [2024-11-19 14:47:23,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 14:47:23,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 14:47:23,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 14:47:23,305 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 14:47:23,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 14:47:23,519 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-11-19 14:47:23,519 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 14:47:23,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 14:47:23,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 14:47:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-19 14:47:23,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 14:47:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-19 14:47:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640906250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 14:47:23,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 14:47:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 26 [2024-11-19 14:47:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832572054] [2024-11-19 14:47:23,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 14:47:23,929 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 14:47:23,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 14:47:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 14:47:23,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-11-19 14:47:23,933 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. cyclomatic complexity: 28 Second operand has 27 states, 27 states have (on average 3.1481481481481484) internal successors, (85), 26 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 14:47:36,876 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 26 DAG size of output: 20 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 14:47:48,963 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 53 DAG size of output: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 14:48:01,011 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 41 DAG size of output: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 14:48:13,147 WARN L286 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 67 DAG size of output: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 14:48:25,229 WARN L286 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 65 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-19 14:48:37,442 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 55 DAG size of output: 23 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)