./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b78564a93d1d434db2fa377a9b33de67cda5b233a427ae8d3550b20661e154a3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:43:50,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:43:50,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:43:50,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:43:50,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:43:50,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:43:50,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:43:50,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:43:50,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:43:50,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:43:50,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:43:50,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:43:50,717 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:43:50,717 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:43:50,719 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:43:50,720 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:43:50,720 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:43:50,720 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:43:50,721 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:43:50,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:43:50,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:43:50,724 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:43:50,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:43:50,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:43:50,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:43:50,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:43:50,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:43:50,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:43:50,726 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:43:50,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:43:50,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:43:50,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:43:50,727 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:43:50,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:43:50,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:43:50,728 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:43:50,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:43:50,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:43:50,729 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:43:50,729 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-clean/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-clean/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 -> b78564a93d1d434db2fa377a9b33de67cda5b233a427ae8d3550b20661e154a3 [2024-10-12 00:43:50,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:43:51,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:43:51,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:43:51,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:43:51,017 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:43:51,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2024-10-12 00:43:52,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:43:52,614 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:43:52,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/nec11.c [2024-10-12 00:43:52,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/104f70108/4300fbc3adf84b58ac5925db6ee4256d/FLAG78b6dcd75 [2024-10-12 00:43:53,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/104f70108/4300fbc3adf84b58ac5925db6ee4256d [2024-10-12 00:43:53,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:43:53,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:43:53,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:43:53,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:43:53,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:43:53,034 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce95c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53, skipping insertion in model container [2024-10-12 00:43:53,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:43:53,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:43:53,261 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:43:53,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:43:53,309 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:43:53,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53 WrapperNode [2024-10-12 00:43:53,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:43:53,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:43:53,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:43:53,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:43:53,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,354 INFO L138 Inliner]: procedures = 13, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 45 [2024-10-12 00:43:53,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:43:53,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:43:53,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:43:53,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:43:53,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,384 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 00:43:53,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:43:53,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:43:53,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:43:53,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:43:53,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (1/1) ... [2024-10-12 00:43:53,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:53,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:53,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:43:53,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:43:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:43:53,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:43:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:43:53,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 00:43:53,559 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:43:53,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:43:53,701 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-12 00:43:53,703 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:43:53,718 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:43:53,718 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 00:43:53,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:43:53 BoogieIcfgContainer [2024-10-12 00:43:53,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:43:53,719 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:43:53,719 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:43:53,724 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:43:53,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:43:53,727 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:43:53" (1/3) ... [2024-10-12 00:43:53,728 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cdaeb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:43:53, skipping insertion in model container [2024-10-12 00:43:53,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:43:53,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:43:53" (2/3) ... [2024-10-12 00:43:53,729 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2cdaeb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:43:53, skipping insertion in model container [2024-10-12 00:43:53,729 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:43:53,729 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:43:53" (3/3) ... [2024-10-12 00:43:53,730 INFO L332 chiAutomizerObserver]: Analyzing ICFG nec11.c [2024-10-12 00:43:53,778 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:43:53,778 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:43:53,778 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:43:53,778 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:43:53,778 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:43:53,778 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:43:53,778 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:43:53,779 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:43:53,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-10-12 00:43:53,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:43:53,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:53,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:53,801 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:43:53,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:53,802 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:43:53,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-10-12 00:43:53,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:43:53,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:53,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:53,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:43:53,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:53,812 INFO L745 eck$LassoCheckResult]: Stem: 11#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);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~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 13#L21-2true [2024-10-12 00:43:53,813 INFO L747 eck$LassoCheckResult]: Loop: 13#L21-2true assume !!(0 != main_~c~0#1 % 256); 12#L23true assume !(4 == main_~len~0#1); 9#L23-2true assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 13#L21-2true [2024-10-12 00:43:53,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:43:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932144033] [2024-10-12 00:43:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:53,915 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:53,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:53,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 40876, now seen corresponding path program 1 times [2024-10-12 00:43:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:53,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259980558] [2024-10-12 00:43:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:53,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:53,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:53,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash 28699818, now seen corresponding path program 1 times [2024-10-12 00:43:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:53,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760427145] [2024-10-12 00:43:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:53,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:54,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:54,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:54,595 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:43:54,595 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:43:54,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:43:54,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:43:54,596 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:43:54,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:54,597 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:43:54,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:43:54,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: nec11.c_Iteration1_Lasso [2024-10-12 00:43:54,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:43:54,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:43:54,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:54,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:43:55,207 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:43:55,211 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:43:55,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:43:55,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:55,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:55,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:55,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:55,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:55,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:55,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:55,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:55,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:55,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:43:55,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:43:55,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:55,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:55,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:55,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:55,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:55,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:55,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:55,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:55,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:55,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:43:55,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,291 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:43:55,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:55,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:55,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:55,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:55,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:55,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:55,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:55,317 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:55,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:43:55,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:43:55,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:55,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:55,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:55,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:55,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:55,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:43:55,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:43:55,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:55,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:43:55,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,372 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:43:55,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:55,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:55,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:43:55,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:55,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:43:55,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:55,387 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:43:55,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:43:55,389 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:43:55,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:43:55,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:43:55,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-12 00:43:55,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:43:55,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:43:55,413 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-10-12 00:43:55,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:43:55,429 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-10-12 00:43:55,429 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-10-12 00:43:55,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:43:55,501 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-10-12 00:43:55,501 INFO L444 ModelExtractionUtils]: 1 out of 11 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-12 00:43:55,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:43:55,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:55,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:43:55,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:43:55,530 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:43:55,545 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-10-12 00:43:55,545 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:43:55,546 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~len~0#1) = -2*ULTIMATE.start_main_~len~0#1 + 9 Supporting invariants [-1*ULTIMATE.start_main_~len~0#1 + 4 >= 0] [2024-10-12 00:43:55,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:43:55,574 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2024-10-12 00:43:55,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:55,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:43:55,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:55,647 WARN L253 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:43:55,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:55,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-12 00:43:55,737 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-12 00:43:55,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-10-12 00:43:55,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) Result 29 states and 39 transitions. Complement of second has 8 states. [2024-10-12 00:43:55,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-12 00:43:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-10-12 00:43:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2024-10-12 00:43:55,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-12 00:43:55,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:55,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-12 00:43:55,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:55,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-12 00:43:55,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:43:55,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2024-10-12 00:43:55,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:43:55,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 10 states and 13 transitions. [2024-10-12 00:43:55,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2024-10-12 00:43:55,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-12 00:43:55,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2024-10-12 00:43:55,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:55,833 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-12 00:43:55,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2024-10-12 00:43:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-10-12 00:43:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-10-12 00:43:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2024-10-12 00:43:55,858 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-12 00:43:55,858 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2024-10-12 00:43:55,858 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:43:55,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2024-10-12 00:43:55,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:43:55,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:55,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:55,859 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:43:55,859 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:55,859 INFO L745 eck$LassoCheckResult]: Stem: 103#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 104#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 105#L21-2 assume !!(0 != main_~c~0#1 % 256); 101#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 97#L23-2 [2024-10-12 00:43:55,859 INFO L747 eck$LassoCheckResult]: Loop: 97#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 98#L21-2 assume !!(0 != main_~c~0#1 % 256); 106#L23 assume !(4 == main_~len~0#1); 97#L23-2 [2024-10-12 00:43:55,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2024-10-12 00:43:55,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:55,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704681271] [2024-10-12 00:43:55,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704681271] [2024-10-12 00:43:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704681271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:43:55,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:43:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:43:55,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756344556] [2024-10-12 00:43:55,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:43:55,964 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:55,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:55,965 INFO L85 PathProgramCache]: Analyzing trace with hash 47446, now seen corresponding path program 2 times [2024-10-12 00:43:55,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:55,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628717562] [2024-10-12 00:43:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:55,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:55,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:55,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:56,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:43:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:43:56,013 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-12 00:43:56,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:56,023 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2024-10-12 00:43:56,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2024-10-12 00:43:56,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2024-10-12 00:43:56,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 15 transitions. [2024-10-12 00:43:56,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2024-10-12 00:43:56,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2024-10-12 00:43:56,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2024-10-12 00:43:56,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:56,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-12 00:43:56,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2024-10-12 00:43:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2024-10-12 00:43:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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-10-12 00:43:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2024-10-12 00:43:56,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:43:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:43:56,028 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2024-10-12 00:43:56,028 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:43:56,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2024-10-12 00:43:56,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:43:56,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:56,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:56,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2024-10-12 00:43:56,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:43:56,029 INFO L745 eck$LassoCheckResult]: Stem: 131#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 132#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 136#L21-2 assume !!(0 != main_~c~0#1 % 256); 134#L23 assume !(4 == main_~len~0#1); 129#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 130#L21-2 assume !!(0 != main_~c~0#1 % 256); 133#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 127#L23-2 [2024-10-12 00:43:56,030 INFO L747 eck$LassoCheckResult]: Loop: 127#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 128#L21-2 assume !!(0 != main_~c~0#1 % 256); 135#L23 assume !(4 == main_~len~0#1); 127#L23-2 [2024-10-12 00:43:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1810721677, now seen corresponding path program 1 times [2024-10-12 00:43:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721769367] [2024-10-12 00:43:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:56,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:43:56,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721769367] [2024-10-12 00:43:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721769367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 00:43:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628996841] [2024-10-12 00:43:56,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 00:43:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:43:56,101 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 00:43:56,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 00:43:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:43:56,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 00:43:56,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:43:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:56,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 00:43:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:43:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628996841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 00:43:56,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 00:43:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-12 00:43:56,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019495544] [2024-10-12 00:43:56,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 00:43:56,207 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:43:56,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:56,207 INFO L85 PathProgramCache]: Analyzing trace with hash 47446, now seen corresponding path program 3 times [2024-10-12 00:43:56,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82833626] [2024-10-12 00:43:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:56,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:56,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:43:56,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 00:43:56,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 00:43:56,258 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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-10-12 00:43:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:43:56,279 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-10-12 00:43:56,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 36 transitions. [2024-10-12 00:43:56,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-12 00:43:56,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 33 transitions. [2024-10-12 00:43:56,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:43:56,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:43:56,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2024-10-12 00:43:56,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:43:56,282 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-10-12 00:43:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2024-10-12 00:43:56,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-10-12 00:43:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 27 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-10-12 00:43:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-10-12 00:43:56,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-12 00:43:56,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 00:43:56,288 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-10-12 00:43:56,289 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:43:56,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2024-10-12 00:43:56,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:43:56,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:43:56,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:43:56,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2024-10-12 00:43:56,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2024-10-12 00:43:56,292 INFO L745 eck$LassoCheckResult]: Stem: 223#$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(8, 2);call write~init~int#1(110, 2, 0, 1);call write~init~int#1(101, 2, 1, 1);call write~init~int#1(99, 2, 2, 1);call write~init~int#1(49, 2, 3, 1);call write~init~int#1(49, 2, 4, 1);call write~init~int#1(46, 2, 5, 1);call write~init~int#1(99, 2, 6, 1);call write~init~int#1(0, 2, 7, 1);call #Ultimate.allocInit(12, 3); 224#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_~a~0#1, main_~len~0#1, main_~c~0#1, main_~i~0#1;havoc main_~a~0#1;main_~len~0#1 := 0;havoc main_#t~nondet4#1;assume 0 == main_#t~nondet4#1 || 1 == main_#t~nondet4#1;main_~c~0#1 := (if 0 == main_#t~nondet4#1 % 256 then 0 else 1);havoc main_#t~nondet4#1;havoc main_~i~0#1; 225#L21-2 assume !!(0 != main_~c~0#1 % 256); 222#L23 assume !(4 == main_~len~0#1); 219#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 220#L21-2 assume !!(0 != main_~c~0#1 % 256); 226#L23 assume !(4 == main_~len~0#1); 244#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 243#L21-2 assume !!(0 != main_~c~0#1 % 256); 242#L23 assume !(4 == main_~len~0#1); 241#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 240#L21-2 assume !!(0 != main_~c~0#1 % 256); 232#L23 assume !(4 == main_~len~0#1); 234#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 231#L21-2 assume !!(0 != main_~c~0#1 % 256); 221#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 217#L23-2 [2024-10-12 00:43:56,292 INFO L747 eck$LassoCheckResult]: Loop: 217#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 218#L21-2 assume !!(0 != main_~c~0#1 % 256); 227#L23 assume !(4 == main_~len~0#1); 228#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 239#L21-2 assume !!(0 != main_~c~0#1 % 256); 238#L23 assume !(4 == main_~len~0#1); 237#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 236#L21-2 assume !!(0 != main_~c~0#1 % 256); 235#L23 assume !(4 == main_~len~0#1); 230#L23-2 assume 0 <= main_~len~0#1 % 4294967296 && main_~len~0#1 % 4294967296 < 5;main_~a~0#1 := main_~a~0#1[main_~len~0#1 := 0];main_#t~post5#1 := main_~len~0#1;main_~len~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 233#L21-2 assume !!(0 != main_~c~0#1 % 256); 229#L23 assume 4 == main_~len~0#1;main_~len~0#1 := 0; 217#L23-2 [2024-10-12 00:43:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash 658202022, now seen corresponding path program 2 times [2024-10-12 00:43:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806138313] [2024-10-12 00:43:56,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1957011391, now seen corresponding path program 1 times [2024-10-12 00:43:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:56,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58650943] [2024-10-12 00:43:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:43:56,381 INFO L85 PathProgramCache]: Analyzing trace with hash -282022428, now seen corresponding path program 3 times [2024-10-12 00:43:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:43:56,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171664221] [2024-10-12 00:43:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:43:56,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:43:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,412 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:43:56,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2024-10-12 00:43:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:56,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:43:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:43:57,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:43:57 BoogieIcfgContainer [2024-10-12 00:43:57,002 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:43:57,002 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:43:57,002 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:43:57,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:43:57,003 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:43:53" (3/4) ... [2024-10-12 00:43:57,004 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:43:57,054 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:43:57,054 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:43:57,054 INFO L158 Benchmark]: Toolchain (without parser) took 4027.02ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 83.0MB in the beginning and 138.2MB in the end (delta: -55.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:43:57,055 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:43:57,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.16ms. Allocated memory is still 148.9MB. Free memory was 83.0MB in the beginning and 119.7MB in the end (delta: -36.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-12 00:43:57,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.51ms. Allocated memory is still 148.9MB. Free memory was 119.7MB in the beginning and 118.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:43:57,056 INFO L158 Benchmark]: Boogie Preprocessor took 43.23ms. Allocated memory is still 148.9MB. Free memory was 118.4MB in the beginning and 116.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:43:57,056 INFO L158 Benchmark]: RCFGBuilder took 319.54ms. Allocated memory is still 148.9MB. Free memory was 116.4MB in the beginning and 105.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:43:57,056 INFO L158 Benchmark]: BuchiAutomizer took 3282.51ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 105.9MB in the beginning and 140.2MB in the end (delta: -34.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:43:57,057 INFO L158 Benchmark]: Witness Printer took 51.69ms. Allocated memory is still 180.4MB. Free memory was 140.2MB in the beginning and 138.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:43:57,058 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.16ms. Allocated memory is still 148.9MB. Free memory was 83.0MB in the beginning and 119.7MB in the end (delta: -36.7MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.51ms. Allocated memory is still 148.9MB. Free memory was 119.7MB in the beginning and 118.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.23ms. Allocated memory is still 148.9MB. Free memory was 118.4MB in the beginning and 116.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.54ms. Allocated memory is still 148.9MB. Free memory was 116.4MB in the beginning and 105.9MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3282.51ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 105.9MB in the beginning and 140.2MB in the end (delta: -34.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.69ms. Allocated memory is still 180.4MB. Free memory was 140.2MB in the beginning and 138.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (9 + ((long long) -2 * len)) and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:5. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 12 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf100 lsp39 ukn44 mio100 lsp69 div305 bol100 ite100 ukn100 eq154 hnf96 smp56 dnf165 smp100 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 145ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 21]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; VAL [c=1, len=0] [L21] COND TRUE \read(c) VAL [c=1, len=0] [L23] COND FALSE !(len==4) VAL [c=1, len=0] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=1] [L21] COND TRUE \read(c) VAL [c=1, len=1] [L23] COND FALSE !(len==4) VAL [c=1, len=1] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=2] [L21] COND TRUE \read(c) VAL [c=1, len=2] [L23] COND FALSE !(len==4) VAL [c=1, len=2] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=3] [L21] COND TRUE \read(c) VAL [c=1, len=3] [L23] COND FALSE !(len==4) VAL [c=1, len=3] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=4] [L21] COND TRUE \read(c) VAL [c=1, len=4] [L23] COND TRUE len==4 [L24] len =0 VAL [c=1, len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int a[5]; [L16] int len=0; [L17] _Bool c=__VERIFIER_nondet_bool(); [L18] int i; VAL [c=1, len=0] [L21] COND TRUE \read(c) VAL [c=1, len=0] [L23] COND FALSE !(len==4) VAL [c=1, len=0] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=1] [L21] COND TRUE \read(c) VAL [c=1, len=1] [L23] COND FALSE !(len==4) VAL [c=1, len=1] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=2] [L21] COND TRUE \read(c) VAL [c=1, len=2] [L23] COND FALSE !(len==4) VAL [c=1, len=2] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=3] [L21] COND TRUE \read(c) VAL [c=1, len=3] [L23] COND FALSE !(len==4) VAL [c=1, len=3] [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ VAL [c=1, len=4] [L21] COND TRUE \read(c) VAL [c=1, len=4] [L23] COND TRUE len==4 [L24] len =0 VAL [c=1, len=0] Loop: [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND FALSE !(len==4) [L26] EXPR a[len] [L26] a[len]=0 [L28] len++ [L21] COND TRUE \read(c) [L23] COND TRUE len==4 [L24] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 00:43:57,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-12 00:43:57,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)