./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d 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/locks/test_locks_5.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 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:15:03,420 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:15:03,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:15:03,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:15:03,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:15:03,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:15:03,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:15:03,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:15:03,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:15:03,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:15:03,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:15:03,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:15:03,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:15:03,512 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:15:03,513 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:15:03,513 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:15:03,513 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:15:03,513 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:15:03,513 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:15:03,516 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:15:03,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:15:03,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:15:03,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:15:03,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:15:03,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:15:03,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:15:03,519 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:15:03,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:15:03,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:15:03,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:15:03,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:15:03,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:15:03,519 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:15:03,520 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 -> 3f68d39859f114df07f2619f37e3285dcdf00194e62a42552d2c67e537c13685 [2024-11-17 08:15:03,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:15:03,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:15:03,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:15:03,717 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:15:03,718 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:15:03,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_5.c [2024-11-17 08:15:04,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:15:05,030 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:15:05,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_5.c [2024-11-17 08:15:05,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0ee6bfb/b951163e92ea4747b15ba97e270abe72/FLAG4b52b1f4e [2024-11-17 08:15:05,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0ee6bfb/b951163e92ea4747b15ba97e270abe72 [2024-11-17 08:15:05,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:15:05,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:15:05,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:15:05,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:15:05,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:15:05,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f851e6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05, skipping insertion in model container [2024-11-17 08:15:05,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:15:05,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:15:05,233 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:15:05,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:15:05,256 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:15:05,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05 WrapperNode [2024-11-17 08:15:05,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:15:05,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:15:05,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:15:05,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:15:05,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,281 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2024-11-17 08:15:05,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:15:05,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:15:05,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:15:05,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:15:05,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,297 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-17 08:15:05,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:15:05,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:15:05,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:15:05,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:15:05,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (1/1) ... [2024-11-17 08:15:05,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:15:05,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:15:05,337 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-17 08:15:05,339 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-17 08:15:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:15:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:15:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:15:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:15:05,431 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:15:05,433 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:15:05,564 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-17 08:15:05,565 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:15:05,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:15:05,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:15:05,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:05 BoogieIcfgContainer [2024-11-17 08:15:05,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:15:05,579 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:15:05,580 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:15:05,583 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:15:05,585 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:05,585 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:15:05" (1/3) ... [2024-11-17 08:15:05,586 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d83785c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:15:05, skipping insertion in model container [2024-11-17 08:15:05,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:05,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:15:05" (2/3) ... [2024-11-17 08:15:05,586 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d83785c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:15:05, skipping insertion in model container [2024-11-17 08:15:05,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:15:05,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:05" (3/3) ... [2024-11-17 08:15:05,587 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_5.c [2024-11-17 08:15:05,635 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:15:05,635 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:15:05,635 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:15:05,635 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:15:05,635 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:15:05,635 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:15:05,635 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:15:05,635 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:15:05,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 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-17 08:15:05,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:15:05,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:05,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:05,657 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:05,657 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:05,658 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:15:05,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 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-17 08:15:05,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2024-11-17 08:15:05,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:05,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:05,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:05,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:05,667 INFO L745 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue 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(15, 2);call #Ultimate.allocInit(12, 3); 22#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 19#L26true [2024-11-17 08:15:05,667 INFO L747 eck$LassoCheckResult]: Loop: 19#L26true assume true; 7#L26-1true assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 24#L28true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 16#L43true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L47true assume !(0 != main_~p2~0#1); 5#L51true assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 20#L55true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L59true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 27#L65true assume !(0 != main_~p1~0#1); 25#L70true assume !(0 != main_~p2~0#1); 23#L75true assume !(0 != main_~p3~0#1); 11#L80true assume !(0 != main_~p4~0#1); 8#L85true assume !(0 != main_~p5~0#1); 19#L26true [2024-11-17 08:15:05,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2976, now seen corresponding path program 1 times [2024-11-17 08:15:05,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:05,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971835684] [2024-11-17 08:15:05,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:05,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:05,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:05,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2012945339, now seen corresponding path program 1 times [2024-11-17 08:15:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641504389] [2024-11-17 08:15:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:05,835 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-17 08:15:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:05,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641504389] [2024-11-17 08:15:05,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641504389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:05,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:05,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097611683] [2024-11-17 08:15:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:05,841 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:05,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:05,866 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 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 4.333333333333333) internal successors, (13), 3 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-11-17 08:15:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:05,893 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2024-11-17 08:15:05,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 71 transitions. [2024-11-17 08:15:05,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2024-11-17 08:15:05,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 37 states and 55 transitions. [2024-11-17 08:15:05,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2024-11-17 08:15:05,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2024-11-17 08:15:05,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 55 transitions. [2024-11-17 08:15:05,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:05,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-11-17 08:15:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 55 transitions. [2024-11-17 08:15:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-17 08:15:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 36 states have internal predecessors, (55), 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-17 08:15:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2024-11-17 08:15:05,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-11-17 08:15:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:05,937 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-11-17 08:15:05,937 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:15:05,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 55 transitions. [2024-11-17 08:15:05,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2024-11-17 08:15:05,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:05,938 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:05,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:05,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:05,939 INFO L745 eck$LassoCheckResult]: Stem: 80#ULTIMATE.startENTRY 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(15, 2);call #Ultimate.allocInit(12, 3); 81#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 89#L26 [2024-11-17 08:15:05,939 INFO L747 eck$LassoCheckResult]: Loop: 89#L26 assume true; 90#L26-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 91#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 101#L43 assume !(0 != main_~p1~0#1); 82#L47 assume !(0 != main_~p2~0#1); 83#L51 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 84#L55 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 85#L59 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 86#L65 assume !(0 != main_~p1~0#1); 102#L70 assume !(0 != main_~p2~0#1); 96#L75 assume !(0 != main_~p3~0#1); 97#L80 assume !(0 != main_~p4~0#1); 87#L85 assume !(0 != main_~p5~0#1); 89#L26 [2024-11-17 08:15:05,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2976, now seen corresponding path program 2 times [2024-11-17 08:15:05,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:05,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963827747] [2024-11-17 08:15:05,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:05,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:05,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2085508452, now seen corresponding path program 1 times [2024-11-17 08:15:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041504685] [2024-11-17 08:15:05,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:06,007 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-17 08:15:06,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:06,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041504685] [2024-11-17 08:15:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041504685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:06,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:06,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846312837] [2024-11-17 08:15:06,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:06,008 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:06,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:06,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:06,009 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-11-17 08:15:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:06,024 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-11-17 08:15:06,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 102 transitions. [2024-11-17 08:15:06,026 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 [2024-11-17 08:15:06,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 102 transitions. [2024-11-17 08:15:06,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-11-17 08:15:06,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-11-17 08:15:06,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 102 transitions. [2024-11-17 08:15:06,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:06,028 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-17 08:15:06,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 102 transitions. [2024-11-17 08:15:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-17 08:15:06,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.457142857142857) internal successors, (102), 69 states have internal predecessors, (102), 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-17 08:15:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-17 08:15:06,037 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-17 08:15:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:06,039 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-17 08:15:06,040 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:15:06,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 102 transitions. [2024-11-17 08:15:06,042 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 [2024-11-17 08:15:06,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:06,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:06,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:06,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:06,045 INFO L745 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY 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(15, 2);call #Ultimate.allocInit(12, 3); 196#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 216#L26 [2024-11-17 08:15:06,045 INFO L747 eck$LassoCheckResult]: Loop: 216#L26 assume true; 237#L26-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 230#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 228#L43 assume !(0 != main_~p1~0#1); 227#L47 assume !(0 != main_~p2~0#1); 226#L51 assume !(0 != main_~p3~0#1); 225#L55 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 224#L59 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 221#L65 assume !(0 != main_~p1~0#1); 222#L70 assume !(0 != main_~p2~0#1); 259#L75 assume !(0 != main_~p3~0#1); 243#L80 assume !(0 != main_~p4~0#1); 240#L85 assume !(0 != main_~p5~0#1); 216#L26 [2024-11-17 08:15:06,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2976, now seen corresponding path program 3 times [2024-11-17 08:15:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600473149] [2024-11-17 08:15:06,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:06,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,059 INFO L85 PathProgramCache]: Analyzing trace with hash -466648509, now seen corresponding path program 1 times [2024-11-17 08:15:06,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125803650] [2024-11-17 08:15:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:06,104 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-17 08:15:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125803650] [2024-11-17 08:15:06,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125803650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:06,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:15:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664306817] [2024-11-17 08:15:06,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:06,105 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:06,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:06,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:06,106 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-11-17 08:15:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:06,125 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2024-11-17 08:15:06,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 190 transitions. [2024-11-17 08:15:06,127 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 132 [2024-11-17 08:15:06,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 134 states and 190 transitions. [2024-11-17 08:15:06,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2024-11-17 08:15:06,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2024-11-17 08:15:06,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 190 transitions. [2024-11-17 08:15:06,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:06,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-17 08:15:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 190 transitions. [2024-11-17 08:15:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-17 08:15:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 133 states have internal predecessors, (190), 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-17 08:15:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-17 08:15:06,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-17 08:15:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:06,137 INFO L425 stractBuchiCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-17 08:15:06,138 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:15:06,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 190 transitions. [2024-11-17 08:15:06,139 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 132 [2024-11-17 08:15:06,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:06,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:06,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:06,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:06,140 INFO L745 eck$LassoCheckResult]: Stem: 403#ULTIMATE.startENTRY 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(15, 2);call #Ultimate.allocInit(12, 3); 404#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 423#L26 [2024-11-17 08:15:06,140 INFO L747 eck$LassoCheckResult]: Loop: 423#L26 assume true; 459#L26-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 457#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 454#L43 assume !(0 != main_~p1~0#1); 451#L47 assume !(0 != main_~p2~0#1); 448#L51 assume !(0 != main_~p3~0#1); 445#L55 assume !(0 != main_~p4~0#1); 441#L59 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 442#L65 assume !(0 != main_~p1~0#1); 472#L70 assume !(0 != main_~p2~0#1); 468#L75 assume !(0 != main_~p3~0#1); 466#L80 assume !(0 != main_~p4~0#1); 464#L85 assume !(0 != main_~p5~0#1); 423#L26 [2024-11-17 08:15:06,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2976, now seen corresponding path program 4 times [2024-11-17 08:15:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557983426] [2024-11-17 08:15:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:06,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash 420855172, now seen corresponding path program 1 times [2024-11-17 08:15:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946991329] [2024-11-17 08:15:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:15:06,182 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-17 08:15:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:15:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946991329] [2024-11-17 08:15:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946991329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:15:06,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:15:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:15:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958602296] [2024-11-17 08:15:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:15:06,183 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:15:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:15:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:15:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:15:06,184 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. cyclomatic complexity: 64 Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-11-17 08:15:06,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:15:06,197 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-11-17 08:15:06,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 354 transitions. [2024-11-17 08:15:06,199 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 256 [2024-11-17 08:15:06,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 354 transitions. [2024-11-17 08:15:06,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2024-11-17 08:15:06,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2024-11-17 08:15:06,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 354 transitions. [2024-11-17 08:15:06,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:15:06,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 354 transitions. [2024-11-17 08:15:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 354 transitions. [2024-11-17 08:15:06,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-17 08:15:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 258 states have (on average 1.372093023255814) internal successors, (354), 257 states have internal predecessors, (354), 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-17 08:15:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2024-11-17 08:15:06,214 INFO L240 hiAutomatonCegarLoop]: Abstraction has 258 states and 354 transitions. [2024-11-17 08:15:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:15:06,215 INFO L425 stractBuchiCegarLoop]: Abstraction has 258 states and 354 transitions. [2024-11-17 08:15:06,215 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:15:06,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 354 transitions. [2024-11-17 08:15:06,216 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 256 [2024-11-17 08:15:06,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:15:06,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:15:06,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:15:06,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:15:06,217 INFO L745 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY 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(15, 2);call #Ultimate.allocInit(12, 3); 802#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_~cond~0#1; 822#L26 [2024-11-17 08:15:06,217 INFO L747 eck$LassoCheckResult]: Loop: 822#L26 assume true; 885#L26-1 assume !false;havoc main_#t~nondet9#1;main_~cond~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 883#L28 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0; 879#L43 assume !(0 != main_~p1~0#1); 877#L47 assume !(0 != main_~p2~0#1); 873#L51 assume !(0 != main_~p3~0#1); 871#L55 assume !(0 != main_~p4~0#1); 867#L59 assume !(0 != main_~p5~0#1); 863#L65 assume !(0 != main_~p1~0#1); 859#L70 assume !(0 != main_~p2~0#1); 855#L75 assume !(0 != main_~p3~0#1); 852#L80 assume !(0 != main_~p4~0#1); 853#L85 assume !(0 != main_~p5~0#1); 822#L26 [2024-11-17 08:15:06,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2976, now seen corresponding path program 5 times [2024-11-17 08:15:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239892470] [2024-11-17 08:15:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,227 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:06,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 449484323, now seen corresponding path program 1 times [2024-11-17 08:15:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812056426] [2024-11-17 08:15:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:06,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:15:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -348871452, now seen corresponding path program 1 times [2024-11-17 08:15:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:15:06,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099090652] [2024-11-17 08:15:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:15:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:15:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:15:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:15:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:15:06,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:15:06 BoogieIcfgContainer [2024-11-17 08:15:06,566 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:15:06,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:15:06,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:15:06,567 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:15:06,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:15:05" (3/4) ... [2024-11-17 08:15:06,569 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:15:06,603 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:15:06,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:15:06,607 INFO L158 Benchmark]: Toolchain (without parser) took 1552.46ms. Allocated memory is still 176.2MB. Free memory was 145.4MB in the beginning and 123.6MB in the end (delta: 21.8MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-17 08:15:06,607 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 87.6MB in the beginning and 87.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:06,607 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.65ms. Allocated memory is still 176.2MB. Free memory was 145.4MB in the beginning and 132.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:15:06,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.57ms. Allocated memory is still 176.2MB. Free memory was 132.9MB in the beginning and 131.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:06,608 INFO L158 Benchmark]: Boogie Preprocessor took 20.06ms. Allocated memory is still 176.2MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:06,609 INFO L158 Benchmark]: IcfgBuilder took 276.67ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 118.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 08:15:06,609 INFO L158 Benchmark]: BuchiAutomizer took 986.62ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 125.7MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:15:06,609 INFO L158 Benchmark]: Witness Printer took 39.66ms. Allocated memory is still 176.2MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:15:06,610 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.13ms. Allocated memory is still 125.8MB. Free memory was 87.6MB in the beginning and 87.5MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.65ms. Allocated memory is still 176.2MB. Free memory was 145.4MB in the beginning and 132.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.57ms. Allocated memory is still 176.2MB. Free memory was 132.9MB in the beginning and 131.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.06ms. Allocated memory is still 176.2MB. Free memory was 131.9MB in the beginning and 129.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 276.67ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 118.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 986.62ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 125.7MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 39.66ms. Allocated memory is still 176.2MB. Free memory was 125.7MB in the beginning and 123.6MB 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 258 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 183 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 26]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 26]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L24] int cond; Loop: [L26] COND TRUE 1 [L27] cond = __VERIFIER_nondet_int() [L28] COND FALSE !(cond == 0) [L31] lk1 = 0 [L33] lk2 = 0 [L35] lk3 = 0 [L37] lk4 = 0 [L39] lk5 = 0 [L43] COND FALSE !(p1 != 0) [L47] COND FALSE !(p2 != 0) [L51] COND FALSE !(p3 != 0) [L55] COND FALSE !(p4 != 0) [L59] COND FALSE !(p5 != 0) [L65] COND FALSE !(p1 != 0) [L70] COND FALSE !(p2 != 0) [L75] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L85] COND FALSE !(p5 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:15:06,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)