./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 023d838f 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_10.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 c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 22:45:36,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 22:45:36,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 22:45:36,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 22:45:36,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 22:45:36,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 22:45:36,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 22:45:36,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 22:45:36,161 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 22:45:36,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 22:45:36,163 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 22:45:36,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 22:45:36,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 22:45:36,165 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 22:45:36,166 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 22:45:36,166 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 22:45:36,169 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 22:45:36,170 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 22:45:36,170 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 22:45:36,170 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 22:45:36,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 22:45:36,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 22:45:36,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 22:45:36,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 22:45:36,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 22:45:36,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 22:45:36,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 22:45:36,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 22:45:36,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 22:45:36,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 22:45:36,173 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 22:45:36,174 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 22:45:36,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 22:45:36,174 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 22:45:36,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 22:45:36,174 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 22:45:36,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 22:45:36,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 22:45:36,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 22:45:36,176 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 22:45:36,177 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 -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2024-11-10 22:45:36,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 22:45:36,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 22:45:36,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 22:45:36,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 22:45:36,481 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 22:45:36,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2024-11-10 22:45:37,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 22:45:38,156 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 22:45:38,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-11-10 22:45:38,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9e8e723/ce29ecbc8dd74f96b546e6d3558a325c/FLAG12f8ccc1b [2024-11-10 22:45:38,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9e8e723/ce29ecbc8dd74f96b546e6d3558a325c [2024-11-10 22:45:38,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 22:45:38,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 22:45:38,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:38,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 22:45:38,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 22:45:38,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df685b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38, skipping insertion in model container [2024-11-10 22:45:38,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 22:45:38,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:38,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 22:45:38,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 22:45:38,799 INFO L204 MainTranslator]: Completed translation [2024-11-10 22:45:38,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38 WrapperNode [2024-11-10 22:45:38,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 22:45:38,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:38,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 22:45:38,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 22:45:38,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,837 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2024-11-10 22:45:38,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 22:45:38,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 22:45:38,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 22:45:38,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 22:45:38,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,860 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-10 22:45:38,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 22:45:38,868 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 22:45:38,869 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 22:45:38,869 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 22:45:38,869 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (1/1) ... [2024-11-10 22:45:38,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 22:45:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 22:45:38,901 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-10 22:45:38,904 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-10 22:45:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 22:45:38,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 22:45:38,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 22:45:38,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 22:45:39,016 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 22:45:39,017 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 22:45:39,207 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-10 22:45:39,208 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 22:45:39,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 22:45:39,229 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 22:45:39,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:39 BoogieIcfgContainer [2024-11-10 22:45:39,230 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 22:45:39,231 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 22:45:39,231 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 22:45:39,236 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 22:45:39,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:39,238 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:45:38" (1/3) ... [2024-11-10 22:45:39,240 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b996ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:39, skipping insertion in model container [2024-11-10 22:45:39,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:39,240 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:45:38" (2/3) ... [2024-11-10 22:45:39,242 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b996ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:45:39, skipping insertion in model container [2024-11-10 22:45:39,242 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 22:45:39,243 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:39" (3/3) ... [2024-11-10 22:45:39,244 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c [2024-11-10 22:45:39,303 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 22:45:39,303 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 22:45:39,303 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 22:45:39,303 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 22:45:39,303 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 22:45:39,304 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 22:45:39,305 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 22:45:39,305 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 22:45:39,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 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-10 22:45:39,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-10 22:45:39,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,334 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,334 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:39,335 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 22:45:39,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 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-10 22:45:39,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2024-11-10 22:45:39,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,339 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,339 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:39,347 INFO L745 eck$LassoCheckResult]: Stem: 17#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(16, 2);call #Ultimate.allocInit(12, 3); 33#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 32#L41true [2024-11-10 22:45:39,350 INFO L747 eck$LassoCheckResult]: Loop: 32#L41true assume true; 7#L41-1true assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 23#L43true 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 27#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 38#L72true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 40#L76true assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 8#L80true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 15#L84true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 31#L88true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 9#L92true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L96true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 26#L100true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18#L104true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3#L110true assume !(0 != main_~p1~0#1); 28#L115true assume !(0 != main_~p2~0#1); 12#L120true assume !(0 != main_~p3~0#1); 21#L125true assume !(0 != main_~p4~0#1); 29#L130true assume !(0 != main_~p5~0#1); 6#L135true assume !(0 != main_~p6~0#1); 25#L140true assume !(0 != main_~p7~0#1); 30#L145true assume !(0 != main_~p8~0#1); 36#L150true assume !(0 != main_~p9~0#1); 14#L155true assume !(0 != main_~p10~0#1); 32#L41true [2024-11-10 22:45:39,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,364 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 1 times [2024-11-10 22:45:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821980338] [2024-11-10 22:45:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,464 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1457199241, now seen corresponding path program 1 times [2024-11-10 22:45:39,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746132111] [2024-11-10 22:45:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,599 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-10 22:45:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746132111] [2024-11-10 22:45:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746132111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269441828] [2024-11-10 22:45:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,605 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,633 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.825) internal successors, (73), 40 states have internal predecessors, (73), 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 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:39,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,666 INFO L93 Difference]: Finished difference Result 75 states and 131 transitions. [2024-11-10 22:45:39,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 131 transitions. [2024-11-10 22:45:39,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2024-11-10 22:45:39,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 67 states and 105 transitions. [2024-11-10 22:45:39,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-11-10 22:45:39,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-11-10 22:45:39,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 105 transitions. [2024-11-10 22:45:39,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 105 transitions. [2024-11-10 22:45:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 105 transitions. [2024-11-10 22:45:39,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 22:45:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.5671641791044777) internal successors, (105), 66 states have internal predecessors, (105), 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-10 22:45:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2024-11-10 22:45:39,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 105 transitions. [2024-11-10 22:45:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,707 INFO L425 stractBuchiCegarLoop]: Abstraction has 67 states and 105 transitions. [2024-11-10 22:45:39,708 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 22:45:39,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 105 transitions. [2024-11-10 22:45:39,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2024-11-10 22:45:39,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,712 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,712 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:39,713 INFO L745 eck$LassoCheckResult]: Stem: 149#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(16, 2);call #Ultimate.allocInit(12, 3); 150#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 145#L41 [2024-11-10 22:45:39,713 INFO L747 eck$LassoCheckResult]: Loop: 145#L41 assume true; 159#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 164#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 162#L68 assume !(0 != main_~p1~0#1); 163#L72 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 191#L76 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 190#L80 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L84 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 188#L88 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 187#L92 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 185#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 184#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 183#L110 assume !(0 != main_~p1~0#1); 156#L115 assume !(0 != main_~p2~0#1); 140#L120 assume !(0 != main_~p3~0#1); 128#L125 assume !(0 != main_~p4~0#1); 148#L130 assume !(0 != main_~p5~0#1); 129#L135 assume !(0 != main_~p6~0#1); 131#L140 assume !(0 != main_~p7~0#1); 142#L145 assume !(0 != main_~p8~0#1); 153#L150 assume !(0 != main_~p9~0#1); 143#L155 assume !(0 != main_~p10~0#1); 145#L41 [2024-11-10 22:45:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 2 times [2024-11-10 22:45:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366960248] [2024-11-10 22:45:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1866023466, now seen corresponding path program 1 times [2024-11-10 22:45:39,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250333319] [2024-11-10 22:45:39,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,782 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-10 22:45:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250333319] [2024-11-10 22:45:39,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250333319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263815887] [2024-11-10 22:45:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,788 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,793 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:39,813 INFO L93 Difference]: Finished difference Result 130 states and 202 transitions. [2024-11-10 22:45:39,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 202 transitions. [2024-11-10 22:45:39,816 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2024-11-10 22:45:39,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 202 transitions. [2024-11-10 22:45:39,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-11-10 22:45:39,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2024-11-10 22:45:39,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 202 transitions. [2024-11-10 22:45:39,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:39,820 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 202 transitions. [2024-11-10 22:45:39,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 202 transitions. [2024-11-10 22:45:39,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-10 22:45:39,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.5538461538461539) internal successors, (202), 129 states have internal predecessors, (202), 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-10 22:45:39,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2024-11-10 22:45:39,837 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 202 transitions. [2024-11-10 22:45:39,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:39,838 INFO L425 stractBuchiCegarLoop]: Abstraction has 130 states and 202 transitions. [2024-11-10 22:45:39,839 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 22:45:39,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 202 transitions. [2024-11-10 22:45:39,854 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 128 [2024-11-10 22:45:39,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:39,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:39,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:39,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:39,856 INFO L745 eck$LassoCheckResult]: Stem: 353#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(16, 2);call #Ultimate.allocInit(12, 3); 354#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 367#L41 [2024-11-10 22:45:39,856 INFO L747 eck$LassoCheckResult]: Loop: 367#L41 assume true; 394#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 392#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 389#L68 assume !(0 != main_~p1~0#1); 390#L72 assume !(0 != main_~p2~0#1); 373#L76 assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; 374#L80 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 380#L84 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 381#L88 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 432#L92 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 378#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 361#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 355#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 356#L110 assume !(0 != main_~p1~0#1); 428#L115 assume !(0 != main_~p2~0#1); 427#L120 assume !(0 != main_~p3~0#1); 425#L125 assume !(0 != main_~p4~0#1); 421#L130 assume !(0 != main_~p5~0#1); 417#L135 assume !(0 != main_~p6~0#1); 410#L140 assume !(0 != main_~p7~0#1); 407#L145 assume !(0 != main_~p8~0#1); 403#L150 assume !(0 != main_~p9~0#1); 399#L155 assume !(0 != main_~p10~0#1); 367#L41 [2024-11-10 22:45:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 3 times [2024-11-10 22:45:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272630445] [2024-11-10 22:45:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:39,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1584471959, now seen corresponding path program 1 times [2024-11-10 22:45:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:39,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679551192] [2024-11-10 22:45:39,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:39,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:39,976 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-10 22:45:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:39,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679551192] [2024-11-10 22:45:39,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679551192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:39,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:39,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:39,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423656861] [2024-11-10 22:45:39,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:39,978 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:39,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:39,980 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,014 INFO L93 Difference]: Finished difference Result 254 states and 390 transitions. [2024-11-10 22:45:40,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 390 transitions. [2024-11-10 22:45:40,017 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2024-11-10 22:45:40,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 254 states and 390 transitions. [2024-11-10 22:45:40,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2024-11-10 22:45:40,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 254 [2024-11-10 22:45:40,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 254 states and 390 transitions. [2024-11-10 22:45:40,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:40,027 INFO L218 hiAutomatonCegarLoop]: Abstraction has 254 states and 390 transitions. [2024-11-10 22:45:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states and 390 transitions. [2024-11-10 22:45:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-10 22:45:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 254 states have (on average 1.5354330708661417) internal successors, (390), 253 states have internal predecessors, (390), 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-10 22:45:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 390 transitions. [2024-11-10 22:45:40,056 INFO L240 hiAutomatonCegarLoop]: Abstraction has 254 states and 390 transitions. [2024-11-10 22:45:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,057 INFO L425 stractBuchiCegarLoop]: Abstraction has 254 states and 390 transitions. [2024-11-10 22:45:40,057 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 22:45:40,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 254 states and 390 transitions. [2024-11-10 22:45:40,060 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 252 [2024-11-10 22:45:40,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:40,061 INFO L745 eck$LassoCheckResult]: Stem: 745#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(16, 2);call #Ultimate.allocInit(12, 3); 746#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 759#L41 [2024-11-10 22:45:40,062 INFO L747 eck$LassoCheckResult]: Loop: 759#L41 assume true; 796#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 792#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 787#L68 assume !(0 != main_~p1~0#1); 788#L72 assume !(0 != main_~p2~0#1); 888#L76 assume !(0 != main_~p3~0#1); 884#L80 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 882#L84 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 880#L88 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 878#L92 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 876#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 874#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 872#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 870#L110 assume !(0 != main_~p1~0#1); 868#L115 assume !(0 != main_~p2~0#1); 864#L120 assume !(0 != main_~p3~0#1); 861#L125 assume !(0 != main_~p4~0#1); 857#L130 assume !(0 != main_~p5~0#1); 853#L135 assume !(0 != main_~p6~0#1); 848#L140 assume !(0 != main_~p7~0#1); 845#L145 assume !(0 != main_~p8~0#1); 841#L150 assume !(0 != main_~p9~0#1); 837#L155 assume !(0 != main_~p10~0#1); 759#L41 [2024-11-10 22:45:40,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 4 times [2024-11-10 22:45:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965222928] [2024-11-10 22:45:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,087 INFO L85 PathProgramCache]: Analyzing trace with hash 587399606, now seen corresponding path program 1 times [2024-11-10 22:45:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247746175] [2024-11-10 22:45:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,154 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-10 22:45:40,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247746175] [2024-11-10 22:45:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247746175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770688224] [2024-11-10 22:45:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,156 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,157 INFO L87 Difference]: Start difference. First operand 254 states and 390 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,191 INFO L93 Difference]: Finished difference Result 498 states and 754 transitions. [2024-11-10 22:45:40,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 498 states and 754 transitions. [2024-11-10 22:45:40,197 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2024-11-10 22:45:40,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 498 states to 498 states and 754 transitions. [2024-11-10 22:45:40,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 498 [2024-11-10 22:45:40,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 498 [2024-11-10 22:45:40,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 498 states and 754 transitions. [2024-11-10 22:45:40,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:40,208 INFO L218 hiAutomatonCegarLoop]: Abstraction has 498 states and 754 transitions. [2024-11-10 22:45:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states and 754 transitions. [2024-11-10 22:45:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2024-11-10 22:45:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 498 states have (on average 1.5140562248995983) internal successors, (754), 497 states have internal predecessors, (754), 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-10 22:45:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 754 transitions. [2024-11-10 22:45:40,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 498 states and 754 transitions. [2024-11-10 22:45:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,245 INFO L425 stractBuchiCegarLoop]: Abstraction has 498 states and 754 transitions. [2024-11-10 22:45:40,246 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 22:45:40,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 498 states and 754 transitions. [2024-11-10 22:45:40,249 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 496 [2024-11-10 22:45:40,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,250 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,251 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:40,251 INFO L745 eck$LassoCheckResult]: Stem: 1503#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(16, 2);call #Ultimate.allocInit(12, 3); 1504#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 1516#L41 [2024-11-10 22:45:40,251 INFO L747 eck$LassoCheckResult]: Loop: 1516#L41 assume true; 1570#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1568#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 1566#L68 assume !(0 != main_~p1~0#1); 1562#L72 assume !(0 != main_~p2~0#1); 1558#L76 assume !(0 != main_~p3~0#1); 1554#L80 assume !(0 != main_~p4~0#1); 1552#L84 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1550#L88 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1548#L92 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1546#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1544#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1542#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1539#L110 assume !(0 != main_~p1~0#1); 1540#L115 assume !(0 != main_~p2~0#1); 1601#L120 assume !(0 != main_~p3~0#1); 1597#L125 assume !(0 != main_~p4~0#1); 1594#L130 assume !(0 != main_~p5~0#1); 1590#L135 assume !(0 != main_~p6~0#1); 1585#L140 assume !(0 != main_~p7~0#1); 1582#L145 assume !(0 != main_~p8~0#1); 1578#L150 assume !(0 != main_~p9~0#1); 1574#L155 assume !(0 != main_~p10~0#1); 1516#L41 [2024-11-10 22:45:40,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 5 times [2024-11-10 22:45:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982184925] [2024-11-10 22:45:40,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1940709303, now seen corresponding path program 1 times [2024-11-10 22:45:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582034586] [2024-11-10 22:45:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,298 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-10 22:45:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582034586] [2024-11-10 22:45:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582034586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:40,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262899976] [2024-11-10 22:45:40,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,300 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,302 INFO L87 Difference]: Start difference. First operand 498 states and 754 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,320 INFO L93 Difference]: Finished difference Result 978 states and 1458 transitions. [2024-11-10 22:45:40,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 978 states and 1458 transitions. [2024-11-10 22:45:40,330 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2024-11-10 22:45:40,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 978 states to 978 states and 1458 transitions. [2024-11-10 22:45:40,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 978 [2024-11-10 22:45:40,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 978 [2024-11-10 22:45:40,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 978 states and 1458 transitions. [2024-11-10 22:45:40,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:40,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 978 states and 1458 transitions. [2024-11-10 22:45:40,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states and 1458 transitions. [2024-11-10 22:45:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2024-11-10 22:45:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 978 states have (on average 1.49079754601227) internal successors, (1458), 977 states have internal predecessors, (1458), 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-10 22:45:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1458 transitions. [2024-11-10 22:45:40,366 INFO L240 hiAutomatonCegarLoop]: Abstraction has 978 states and 1458 transitions. [2024-11-10 22:45:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,369 INFO L425 stractBuchiCegarLoop]: Abstraction has 978 states and 1458 transitions. [2024-11-10 22:45:40,369 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-10 22:45:40,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 978 states and 1458 transitions. [2024-11-10 22:45:40,375 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 976 [2024-11-10 22:45:40,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:40,377 INFO L745 eck$LassoCheckResult]: Stem: 2986#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(16, 2);call #Ultimate.allocInit(12, 3); 2987#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 2999#L41 [2024-11-10 22:45:40,377 INFO L747 eck$LassoCheckResult]: Loop: 2999#L41 assume true; 3121#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 3120#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 3118#L68 assume !(0 != main_~p1~0#1); 3116#L72 assume !(0 != main_~p2~0#1); 3113#L76 assume !(0 != main_~p3~0#1); 3110#L80 assume !(0 != main_~p4~0#1); 3102#L84 assume !(0 != main_~p5~0#1); 3104#L88 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 3094#L92 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3095#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3086#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3087#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3076#L110 assume !(0 != main_~p1~0#1); 3078#L115 assume !(0 != main_~p2~0#1); 3066#L120 assume !(0 != main_~p3~0#1); 3067#L125 assume !(0 != main_~p4~0#1); 3132#L130 assume !(0 != main_~p5~0#1); 3131#L135 assume !(0 != main_~p6~0#1); 3128#L140 assume !(0 != main_~p7~0#1); 3127#L145 assume !(0 != main_~p8~0#1); 3125#L150 assume !(0 != main_~p9~0#1); 3123#L155 assume !(0 != main_~p10~0#1); 2999#L41 [2024-11-10 22:45:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 6 times [2024-11-10 22:45:40,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377279440] [2024-11-10 22:45:40,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1430175126, now seen corresponding path program 1 times [2024-11-10 22:45:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753807481] [2024-11-10 22:45:40,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,444 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-10 22:45:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753807481] [2024-11-10 22:45:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753807481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501526544] [2024-11-10 22:45:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,448 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,449 INFO L87 Difference]: Start difference. First operand 978 states and 1458 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,478 INFO L93 Difference]: Finished difference Result 1922 states and 2818 transitions. [2024-11-10 22:45:40,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1922 states and 2818 transitions. [2024-11-10 22:45:40,503 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2024-11-10 22:45:40,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1922 states to 1922 states and 2818 transitions. [2024-11-10 22:45:40,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1922 [2024-11-10 22:45:40,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1922 [2024-11-10 22:45:40,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1922 states and 2818 transitions. [2024-11-10 22:45:40,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:40,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2024-11-10 22:45:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states and 2818 transitions. [2024-11-10 22:45:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2024-11-10 22:45:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1922 states have (on average 1.4661810613943809) internal successors, (2818), 1921 states have internal predecessors, (2818), 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-10 22:45:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2818 transitions. [2024-11-10 22:45:40,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2024-11-10 22:45:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,571 INFO L425 stractBuchiCegarLoop]: Abstraction has 1922 states and 2818 transitions. [2024-11-10 22:45:40,571 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-10 22:45:40,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1922 states and 2818 transitions. [2024-11-10 22:45:40,582 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1920 [2024-11-10 22:45:40,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,584 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:40,585 INFO L745 eck$LassoCheckResult]: Stem: 5892#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(16, 2);call #Ultimate.allocInit(12, 3); 5893#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 5907#L41 [2024-11-10 22:45:40,585 INFO L747 eck$LassoCheckResult]: Loop: 5907#L41 assume true; 6094#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 6093#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 6091#L68 assume !(0 != main_~p1~0#1); 6087#L72 assume !(0 != main_~p2~0#1); 6083#L76 assume !(0 != main_~p3~0#1); 6080#L80 assume !(0 != main_~p4~0#1); 6081#L84 assume !(0 != main_~p5~0#1); 6121#L88 assume !(0 != main_~p6~0#1); 6120#L92 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6119#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6118#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6117#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6115#L110 assume !(0 != main_~p1~0#1); 6113#L115 assume !(0 != main_~p2~0#1); 6112#L120 assume !(0 != main_~p3~0#1); 6111#L125 assume !(0 != main_~p4~0#1); 6108#L130 assume !(0 != main_~p5~0#1); 6106#L135 assume !(0 != main_~p6~0#1); 6104#L140 assume !(0 != main_~p7~0#1); 6103#L145 assume !(0 != main_~p8~0#1); 6101#L150 assume !(0 != main_~p9~0#1); 6096#L155 assume !(0 != main_~p10~0#1); 5907#L41 [2024-11-10 22:45:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 7 times [2024-11-10 22:45:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841156468] [2024-11-10 22:45:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1357240361, now seen corresponding path program 1 times [2024-11-10 22:45:40,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446580784] [2024-11-10 22:45:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,630 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-10 22:45:40,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446580784] [2024-11-10 22:45:40,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446580784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:40,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157501133] [2024-11-10 22:45:40,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,632 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,633 INFO L87 Difference]: Start difference. First operand 1922 states and 2818 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,660 INFO L93 Difference]: Finished difference Result 3778 states and 5442 transitions. [2024-11-10 22:45:40,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3778 states and 5442 transitions. [2024-11-10 22:45:40,689 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2024-11-10 22:45:40,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3778 states to 3778 states and 5442 transitions. [2024-11-10 22:45:40,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3778 [2024-11-10 22:45:40,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3778 [2024-11-10 22:45:40,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3778 states and 5442 transitions. [2024-11-10 22:45:40,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:40,724 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2024-11-10 22:45:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states and 5442 transitions. [2024-11-10 22:45:40,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3778. [2024-11-10 22:45:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3778 states, 3778 states have (on average 1.4404446797247221) internal successors, (5442), 3777 states have internal predecessors, (5442), 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-10 22:45:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 5442 transitions. [2024-11-10 22:45:40,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2024-11-10 22:45:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:40,798 INFO L425 stractBuchiCegarLoop]: Abstraction has 3778 states and 5442 transitions. [2024-11-10 22:45:40,800 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-10 22:45:40,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3778 states and 5442 transitions. [2024-11-10 22:45:40,819 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3776 [2024-11-10 22:45:40,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:40,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:40,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:40,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:40,821 INFO L745 eck$LassoCheckResult]: Stem: 11598#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(16, 2);call #Ultimate.allocInit(12, 3); 11599#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 11612#L41 [2024-11-10 22:45:40,821 INFO L747 eck$LassoCheckResult]: Loop: 11612#L41 assume true; 11897#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11894#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 11868#L68 assume !(0 != main_~p1~0#1); 11860#L72 assume !(0 != main_~p2~0#1); 11852#L76 assume !(0 != main_~p3~0#1); 11853#L80 assume !(0 != main_~p4~0#1); 11923#L84 assume !(0 != main_~p5~0#1); 11921#L88 assume !(0 != main_~p6~0#1); 11919#L92 assume !(0 != main_~p7~0#1); 11918#L96 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 11915#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11912#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11908#L110 assume !(0 != main_~p1~0#1); 11796#L115 assume !(0 != main_~p2~0#1); 11798#L120 assume !(0 != main_~p3~0#1); 11900#L125 assume !(0 != main_~p4~0#1); 11916#L130 assume !(0 != main_~p5~0#1); 11913#L135 assume !(0 != main_~p6~0#1); 11910#L140 assume !(0 != main_~p7~0#1); 11906#L145 assume !(0 != main_~p8~0#1); 11902#L150 assume !(0 != main_~p9~0#1); 11899#L155 assume !(0 != main_~p10~0#1); 11612#L41 [2024-11-10 22:45:40,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 8 times [2024-11-10 22:45:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824670547] [2024-11-10 22:45:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:40,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:40,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:40,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1862798986, now seen corresponding path program 1 times [2024-11-10 22:45:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:40,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378101812] [2024-11-10 22:45:40,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:40,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:40,873 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-10 22:45:40,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:40,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378101812] [2024-11-10 22:45:40,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378101812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:40,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:40,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647581969] [2024-11-10 22:45:40,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:40,876 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:40,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:40,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:40,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:40,877 INFO L87 Difference]: Start difference. First operand 3778 states and 5442 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:40,955 INFO L93 Difference]: Finished difference Result 7426 states and 10498 transitions. [2024-11-10 22:45:40,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7426 states and 10498 transitions. [2024-11-10 22:45:41,001 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2024-11-10 22:45:41,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7426 states to 7426 states and 10498 transitions. [2024-11-10 22:45:41,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7426 [2024-11-10 22:45:41,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7426 [2024-11-10 22:45:41,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7426 states and 10498 transitions. [2024-11-10 22:45:41,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:41,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2024-11-10 22:45:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states and 10498 transitions. [2024-11-10 22:45:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 7426. [2024-11-10 22:45:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7426 states have (on average 1.41368165903582) internal successors, (10498), 7425 states have internal predecessors, (10498), 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-10 22:45:41,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 10498 transitions. [2024-11-10 22:45:41,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2024-11-10 22:45:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:41,186 INFO L425 stractBuchiCegarLoop]: Abstraction has 7426 states and 10498 transitions. [2024-11-10 22:45:41,187 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-10 22:45:41,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7426 states and 10498 transitions. [2024-11-10 22:45:41,214 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7424 [2024-11-10 22:45:41,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:41,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:41,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:41,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:41,216 INFO L745 eck$LassoCheckResult]: Stem: 22806#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(16, 2);call #Ultimate.allocInit(12, 3); 22807#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 22821#L41 [2024-11-10 22:45:41,216 INFO L747 eck$LassoCheckResult]: Loop: 22821#L41 assume true; 23101#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 23099#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 23095#L68 assume !(0 != main_~p1~0#1); 23091#L72 assume !(0 != main_~p2~0#1); 23088#L76 assume !(0 != main_~p3~0#1); 23089#L80 assume !(0 != main_~p4~0#1); 23162#L84 assume !(0 != main_~p5~0#1); 23157#L88 assume !(0 != main_~p6~0#1); 23152#L92 assume !(0 != main_~p7~0#1); 23148#L96 assume !(0 != main_~p8~0#1); 23145#L100 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 23142#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 23138#L110 assume !(0 != main_~p1~0#1); 23133#L115 assume !(0 != main_~p2~0#1); 23130#L120 assume !(0 != main_~p3~0#1); 23128#L125 assume !(0 != main_~p4~0#1); 23124#L130 assume !(0 != main_~p5~0#1); 23120#L135 assume !(0 != main_~p6~0#1); 23116#L140 assume !(0 != main_~p7~0#1); 23112#L145 assume !(0 != main_~p8~0#1); 23109#L150 assume !(0 != main_~p9~0#1); 23105#L155 assume !(0 != main_~p10~0#1); 22821#L41 [2024-11-10 22:45:41,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 9 times [2024-11-10 22:45:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10809905] [2024-11-10 22:45:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:41,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:41,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:41,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2138765303, now seen corresponding path program 1 times [2024-11-10 22:45:41,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:41,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609472915] [2024-11-10 22:45:41,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:41,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:41,263 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-10 22:45:41,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:41,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609472915] [2024-11-10 22:45:41,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609472915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:41,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:41,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 22:45:41,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522263173] [2024-11-10 22:45:41,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:41,264 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:41,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:41,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:41,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:41,265 INFO L87 Difference]: Start difference. First operand 7426 states and 10498 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:41,322 INFO L93 Difference]: Finished difference Result 14594 states and 20226 transitions. [2024-11-10 22:45:41,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14594 states and 20226 transitions. [2024-11-10 22:45:41,457 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2024-11-10 22:45:41,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14594 states to 14594 states and 20226 transitions. [2024-11-10 22:45:41,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14594 [2024-11-10 22:45:41,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14594 [2024-11-10 22:45:41,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14594 states and 20226 transitions. [2024-11-10 22:45:41,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:41,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2024-11-10 22:45:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14594 states and 20226 transitions. [2024-11-10 22:45:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14594 to 14594. [2024-11-10 22:45:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14594 states, 14594 states have (on average 1.3859120186377965) internal successors, (20226), 14593 states have internal predecessors, (20226), 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-10 22:45:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14594 states to 14594 states and 20226 transitions. [2024-11-10 22:45:41,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2024-11-10 22:45:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:41,970 INFO L425 stractBuchiCegarLoop]: Abstraction has 14594 states and 20226 transitions. [2024-11-10 22:45:41,970 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-10 22:45:41,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14594 states and 20226 transitions. [2024-11-10 22:45:42,021 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14592 [2024-11-10 22:45:42,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:42,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:42,023 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:42,023 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:42,023 INFO L745 eck$LassoCheckResult]: Stem: 44833#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(16, 2);call #Ultimate.allocInit(12, 3); 44834#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 44850#L41 [2024-11-10 22:45:42,023 INFO L747 eck$LassoCheckResult]: Loop: 44850#L41 assume true; 44996#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 44993#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 44989#L68 assume !(0 != main_~p1~0#1); 44986#L72 assume !(0 != main_~p2~0#1); 44982#L76 assume !(0 != main_~p3~0#1); 44978#L80 assume !(0 != main_~p4~0#1); 44974#L84 assume !(0 != main_~p5~0#1); 44970#L88 assume !(0 != main_~p6~0#1); 44920#L92 assume !(0 != main_~p7~0#1); 44916#L96 assume !(0 != main_~p8~0#1); 44906#L100 assume !(0 != main_~p9~0#1); 44907#L104 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 45063#L110 assume !(0 != main_~p1~0#1); 45059#L115 assume !(0 != main_~p2~0#1); 45056#L120 assume !(0 != main_~p3~0#1); 45053#L125 assume !(0 != main_~p4~0#1); 45036#L130 assume !(0 != main_~p5~0#1); 45032#L135 assume !(0 != main_~p6~0#1); 45024#L140 assume !(0 != main_~p7~0#1); 45017#L145 assume !(0 != main_~p8~0#1); 45012#L150 assume !(0 != main_~p9~0#1); 45002#L155 assume !(0 != main_~p10~0#1); 44850#L41 [2024-11-10 22:45:42,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 10 times [2024-11-10 22:45:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:42,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360157408] [2024-11-10 22:45:42,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:42,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:42,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:42,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:42,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:42,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2027119274, now seen corresponding path program 1 times [2024-11-10 22:45:42,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:42,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128275979] [2024-11-10 22:45:42,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 22:45:42,050 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-10 22:45:42,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 22:45:42,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128275979] [2024-11-10 22:45:42,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128275979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 22:45:42,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 22:45:42,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 22:45:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332161995] [2024-11-10 22:45:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 22:45:42,051 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 22:45:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 22:45:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 22:45:42,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 22:45:42,052 INFO L87 Difference]: Start difference. First operand 14594 states and 20226 transitions. cyclomatic complexity: 6144 Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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-10 22:45:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 22:45:42,133 INFO L93 Difference]: Finished difference Result 28674 states and 38914 transitions. [2024-11-10 22:45:42,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28674 states and 38914 transitions. [2024-11-10 22:45:42,388 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 28672 [2024-11-10 22:45:42,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28674 states to 28674 states and 38914 transitions. [2024-11-10 22:45:42,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28674 [2024-11-10 22:45:42,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28674 [2024-11-10 22:45:42,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28674 states and 38914 transitions. [2024-11-10 22:45:42,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 22:45:42,600 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28674 states and 38914 transitions. [2024-11-10 22:45:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28674 states and 38914 transitions. [2024-11-10 22:45:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28674 to 28674. [2024-11-10 22:45:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28674 states, 28674 states have (on average 1.3571179465718073) internal successors, (38914), 28673 states have internal predecessors, (38914), 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-10 22:45:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28674 states to 28674 states and 38914 transitions. [2024-11-10 22:45:43,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28674 states and 38914 transitions. [2024-11-10 22:45:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 22:45:43,080 INFO L425 stractBuchiCegarLoop]: Abstraction has 28674 states and 38914 transitions. [2024-11-10 22:45:43,081 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-10 22:45:43,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28674 states and 38914 transitions. [2024-11-10 22:45:43,171 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 28672 [2024-11-10 22:45:43,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 22:45:43,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 22:45:43,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-10 22:45:43,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 22:45:43,173 INFO L745 eck$LassoCheckResult]: Stem: 88107#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(16, 2);call #Ultimate.allocInit(12, 3); 88108#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_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#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_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~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_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 88125#L41 [2024-11-10 22:45:43,174 INFO L747 eck$LassoCheckResult]: Loop: 88125#L41 assume true; 88706#L41-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 88707#L43 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;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 88693#L68 assume !(0 != main_~p1~0#1); 88695#L72 assume !(0 != main_~p2~0#1); 88677#L76 assume !(0 != main_~p3~0#1); 88679#L80 assume !(0 != main_~p4~0#1); 88818#L84 assume !(0 != main_~p5~0#1); 88815#L88 assume !(0 != main_~p6~0#1); 88811#L92 assume !(0 != main_~p7~0#1); 88807#L96 assume !(0 != main_~p8~0#1); 88804#L100 assume !(0 != main_~p9~0#1); 88800#L104 assume !(0 != main_~p10~0#1); 88798#L110 assume !(0 != main_~p1~0#1); 88796#L115 assume !(0 != main_~p2~0#1); 88756#L120 assume !(0 != main_~p3~0#1); 88752#L125 assume !(0 != main_~p4~0#1); 88748#L130 assume !(0 != main_~p5~0#1); 88489#L135 assume !(0 != main_~p6~0#1); 88483#L140 assume !(0 != main_~p7~0#1); 88485#L145 assume !(0 != main_~p8~0#1); 88720#L150 assume !(0 != main_~p9~0#1); 88721#L155 assume !(0 != main_~p10~0#1); 88125#L41 [2024-11-10 22:45:43,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:43,175 INFO L85 PathProgramCache]: Analyzing trace with hash 4416, now seen corresponding path program 11 times [2024-11-10 22:45:43,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:43,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445311350] [2024-11-10 22:45:43,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash 470896663, now seen corresponding path program 1 times [2024-11-10 22:45:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512529845] [2024-11-10 22:45:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:43,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 22:45:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 988825592, now seen corresponding path program 1 times [2024-11-10 22:45:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 22:45:43,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661716209] [2024-11-10 22:45:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 22:45:43,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 22:45:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 22:45:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 22:45:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 22:45:43,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:45:43 BoogieIcfgContainer [2024-11-10 22:45:43,795 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-10 22:45:43,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 22:45:43,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 22:45:43,798 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 22:45:43,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:45:39" (3/4) ... [2024-11-10 22:45:43,800 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-10 22:45:43,844 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 22:45:43,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 22:45:43,845 INFO L158 Benchmark]: Toolchain (without parser) took 5301.43ms. Allocated memory was 176.2MB in the beginning and 478.2MB in the end (delta: 302.0MB). Free memory was 136.7MB in the beginning and 238.8MB in the end (delta: -102.1MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. [2024-11-10 22:45:43,845 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 176.2MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:43,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.81ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 123.6MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:43,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 122.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 22:45:43,846 INFO L158 Benchmark]: Boogie Preprocessor took 28.79ms. Allocated memory is still 176.2MB. Free memory was 122.0MB in the beginning and 120.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:43,846 INFO L158 Benchmark]: IcfgBuilder took 361.51ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 106.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 22:45:43,846 INFO L158 Benchmark]: BuchiAutomizer took 4564.27ms. Allocated memory was 176.2MB in the beginning and 478.2MB in the end (delta: 302.0MB). Free memory was 105.8MB in the beginning and 240.9MB in the end (delta: -135.1MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. [2024-11-10 22:45:43,847 INFO L158 Benchmark]: Witness Printer took 48.63ms. Allocated memory is still 478.2MB. Free memory was 240.9MB in the beginning and 238.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 22:45:43,848 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.22ms. Allocated memory is still 176.2MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.81ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 123.6MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 122.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.79ms. Allocated memory is still 176.2MB. Free memory was 122.0MB in the beginning and 120.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 361.51ms. Allocated memory is still 176.2MB. Free memory was 120.4MB in the beginning and 106.3MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 4564.27ms. Allocated memory was 176.2MB in the beginning and 478.2MB in the end (delta: 302.0MB). Free memory was 105.8MB in the beginning and 240.9MB in the end (delta: -135.1MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. * Witness Printer took 48.63ms. Allocated memory is still 478.2MB. Free memory was 240.9MB in the beginning and 238.8MB 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 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 28674 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.8s 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, 422 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 1323 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 502 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 821 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 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: 41]: 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; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 41]: 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; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L39] int cond; Loop: [L41] COND TRUE 1 [L42] cond = __VERIFIER_nondet_int() [L43] COND FALSE !(cond == 0) [L46] lk1 = 0 [L48] lk2 = 0 [L50] lk3 = 0 [L52] lk4 = 0 [L54] lk5 = 0 [L56] lk6 = 0 [L58] lk7 = 0 [L60] lk8 = 0 [L62] lk9 = 0 [L64] lk10 = 0 [L68] COND FALSE !(p1 != 0) [L72] COND FALSE !(p2 != 0) [L76] COND FALSE !(p3 != 0) [L80] COND FALSE !(p4 != 0) [L84] COND FALSE !(p5 != 0) [L88] COND FALSE !(p6 != 0) [L92] COND FALSE !(p7 != 0) [L96] COND FALSE !(p8 != 0) [L100] COND FALSE !(p9 != 0) [L104] COND FALSE !(p10 != 0) [L110] COND FALSE !(p1 != 0) [L115] COND FALSE !(p2 != 0) [L120] COND FALSE !(p3 != 0) [L125] COND FALSE !(p4 != 0) [L130] COND FALSE !(p5 != 0) [L135] COND FALSE !(p6 != 0) [L140] COND FALSE !(p7 != 0) [L145] COND FALSE !(p8 != 0) [L150] COND FALSE !(p9 != 0) [L155] COND FALSE !(p10 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-10 22:45:43,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)