./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_15-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU --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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:01:45,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:01:45,989 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-31 22:01:45,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:01:45,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:01:46,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:01:46,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:01:46,036 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:01:46,038 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:01:46,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:01:46,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:01:46,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:01:46,040 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:01:46,041 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 22:01:46,041 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 22:01:46,041 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 22:01:46,042 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 22:01:46,045 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 22:01:46,045 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 22:01:46,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:01:46,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 22:01:46,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:01:46,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:01:46,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:01:46,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:01:46,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 22:01:46,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 22:01:46,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 22:01:46,052 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:01:46,052 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:01:46,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:01:46,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:01:46,053 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 22:01:46,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:01:46,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:01:46,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:01:46,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:01:46,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:01:46,055 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 22:01:46,055 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2024-10-31 22:01:46,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:01:46,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:01:46,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:01:46,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:01:46,397 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:01:46,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/locks/test_locks_15-2.c Unable to find full path for "g++" [2024-10-31 22:01:48,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:01:48,717 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:01:48,718 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/sv-benchmarks/c/locks/test_locks_15-2.c [2024-10-31 22:01:48,730 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/data/c249700f5/79fc2c3257884c078f045fa4591bd227/FLAG59332998d [2024-10-31 22:01:49,100 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/data/c249700f5/79fc2c3257884c078f045fa4591bd227 [2024-10-31 22:01:49,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:01:49,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:01:49,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:49,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:01:49,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:01:49,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339184ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49, skipping insertion in model container [2024-10-31 22:01:49,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:01:49,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:49,453 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:01:49,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:49,555 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:01:49,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49 WrapperNode [2024-10-31 22:01:49,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:49,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:49,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:01:49,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:01:49,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,580 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,622 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 193 [2024-10-31 22:01:49,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:49,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:01:49,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:01:49,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:01:49,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,679 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-10-31 22:01:49,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:01:49,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:01:49,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:01:49,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:01:49,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (1/1) ... [2024-10-31 22:01:49,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 22:01:49,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:49,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 22:01:49,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ded9d252-d11e-4ea0-bc49-dc90ab271c69/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 22:01:49,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:01:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:01:49,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:01:49,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:01:49,920 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:01:49,923 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:01:50,330 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-31 22:01:50,330 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:01:50,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:01:50,345 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:01:50,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:50 BoogieIcfgContainer [2024-10-31 22:01:50,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:01:50,346 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 22:01:50,347 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 22:01:50,350 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 22:01:50,351 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:01:50,351 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 10:01:49" (1/3) ... [2024-10-31 22:01:50,352 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3476fd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:01:50, skipping insertion in model container [2024-10-31 22:01:50,353 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:01:50,353 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:49" (2/3) ... [2024-10-31 22:01:50,353 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3476fd8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 10:01:50, skipping insertion in model container [2024-10-31 22:01:50,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 22:01:50,354 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:50" (3/3) ... [2024-10-31 22:01:50,355 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2024-10-31 22:01:50,418 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 22:01:50,419 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 22:01:50,419 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 22:01:50,419 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 22:01:50,419 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 22:01:50,419 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 22:01:50,419 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 22:01:50,420 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 22:01:50,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:50,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-31 22:01:50,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:50,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:50,449 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:50,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:50,450 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 22:01:50,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:50,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2024-10-31 22:01:50,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:50,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:50,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:50,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:50,468 INFO L745 eck$LassoCheckResult]: Stem: 24#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33#L-1true 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 19#L225-1true [2024-10-31 22:01:50,469 INFO L747 eck$LassoCheckResult]: Loop: 19#L225-1true assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 25#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L97-1true assume !(0 != main_~p3~0#1); 15#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 51#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 44#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 21#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 5#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 39#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 46#L155-1true assume !(0 != main_~p2~0#1); 27#L160-1true assume !(0 != main_~p3~0#1); 10#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 45#L175-1true assume !(0 != main_~p6~0#1); 17#L180-1true assume !(0 != main_~p7~0#1); 38#L185-1true assume !(0 != main_~p8~0#1); 23#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 14#L200-1true assume !(0 != main_~p11~0#1); 43#L205-1true assume !(0 != main_~p12~0#1); 22#L210-1true assume !(0 != main_~p13~0#1); 4#L215-1true assume !(0 != main_~p14~0#1); 36#L220-1true assume !(0 != main_~p15~0#1); 19#L225-1true [2024-10-31 22:01:50,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-31 22:01:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:50,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547987307] [2024-10-31 22:01:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:50,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:50,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:50,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:50,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2024-10-31 22:01:50,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092037394] [2024-10-31 22:01:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092037394] [2024-10-31 22:01:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092037394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:50,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:50,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243407848] [2024-10-31 22:01:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:50,787 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:50,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:50,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:50,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:50,823 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:50,865 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2024-10-31 22:01:50,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 189 transitions. [2024-10-31 22:01:50,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-10-31 22:01:50,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 95 states and 153 transitions. [2024-10-31 22:01:50,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2024-10-31 22:01:50,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2024-10-31 22:01:50,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2024-10-31 22:01:50,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:50,886 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-10-31 22:01:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2024-10-31 22:01:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-31 22:01:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2024-10-31 22:01:50,920 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-10-31 22:01:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:50,925 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2024-10-31 22:01:50,925 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 22:01:50,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2024-10-31 22:01:50,929 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2024-10-31 22:01:50,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:50,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:50,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:50,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:50,931 INFO L745 eck$LassoCheckResult]: Stem: 204#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 205#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 211#L225-1 [2024-10-31 22:01:50,931 INFO L747 eck$LassoCheckResult]: Loop: 211#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 222#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 221#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 184#L97-1 assume !(0 != main_~p3~0#1); 185#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 189#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 217#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 256#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 191#L129-1 assume !(0 != main_~p11~0#1); 212#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 254#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 253#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 252#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 251#L149-1 assume !(0 != main_~p1~0#1); 250#L155-1 assume !(0 != main_~p2~0#1); 248#L160-1 assume !(0 != main_~p3~0#1); 246#L165-1 assume !(0 != main_~p4~0#1); 243#L170-1 assume !(0 != main_~p5~0#1); 242#L175-1 assume !(0 != main_~p6~0#1); 240#L180-1 assume !(0 != main_~p7~0#1); 237#L185-1 assume !(0 != main_~p8~0#1); 236#L190-1 assume !(0 != main_~p9~0#1); 234#L195-1 assume !(0 != main_~p10~0#1); 232#L200-1 assume !(0 != main_~p11~0#1); 230#L205-1 assume !(0 != main_~p12~0#1); 228#L210-1 assume !(0 != main_~p13~0#1); 226#L215-1 assume !(0 != main_~p14~0#1); 224#L220-1 assume !(0 != main_~p15~0#1); 211#L225-1 [2024-10-31 22:01:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-31 22:01:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:50,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626984455] [2024-10-31 22:01:50,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:50,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:50,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:50,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:50,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2024-10-31 22:01:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:50,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020347146] [2024-10-31 22:01:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020347146] [2024-10-31 22:01:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020347146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789839963] [2024-10-31 22:01:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,057 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,058 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:51,100 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2024-10-31 22:01:51,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2024-10-31 22:01:51,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-10-31 22:01:51,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2024-10-31 22:01:51,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2024-10-31 22:01:51,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2024-10-31 22:01:51,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2024-10-31 22:01:51,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:51,109 INFO L218 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-10-31 22:01:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2024-10-31 22:01:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2024-10-31 22:01:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2024-10-31 22:01:51,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-10-31 22:01:51,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,128 INFO L425 stractBuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2024-10-31 22:01:51,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 22:01:51,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2024-10-31 22:01:51,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2024-10-31 22:01:51,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:51,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:51,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:51,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,139 INFO L745 eck$LassoCheckResult]: Stem: 491#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 492#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 498#L225-1 [2024-10-31 22:01:51,139 INFO L747 eck$LassoCheckResult]: Loop: 498#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 516#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 512#L93 assume !(0 != main_~p1~0#1); 513#L93-2 assume !(0 != main_~p2~0#1); 639#L97-1 assume !(0 != main_~p3~0#1); 638#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 637#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 636#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 635#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 634#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 633#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 632#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 499#L129-1 assume !(0 != main_~p11~0#1); 500#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 527#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 528#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 523#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 524#L149-1 assume !(0 != main_~p1~0#1); 608#L155-1 assume !(0 != main_~p2~0#1); 606#L160-1 assume !(0 != main_~p3~0#1); 604#L165-1 assume !(0 != main_~p4~0#1); 599#L170-1 assume !(0 != main_~p5~0#1); 590#L175-1 assume !(0 != main_~p6~0#1); 582#L180-1 assume !(0 != main_~p7~0#1); 577#L185-1 assume !(0 != main_~p8~0#1); 572#L190-1 assume !(0 != main_~p9~0#1); 570#L195-1 assume !(0 != main_~p10~0#1); 564#L200-1 assume !(0 != main_~p11~0#1); 560#L205-1 assume !(0 != main_~p12~0#1); 552#L210-1 assume !(0 != main_~p13~0#1); 548#L215-1 assume !(0 != main_~p14~0#1); 546#L220-1 assume !(0 != main_~p15~0#1); 498#L225-1 [2024-10-31 22:01:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-31 22:01:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56971635] [2024-10-31 22:01:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,147 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:51,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,155 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2024-10-31 22:01:51,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704056491] [2024-10-31 22:01:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:51,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704056491] [2024-10-31 22:01:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704056491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:51,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567046317] [2024-10-31 22:01:51,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,228 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:51,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,229 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:51,254 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2024-10-31 22:01:51,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2024-10-31 22:01:51,258 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-10-31 22:01:51,261 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2024-10-31 22:01:51,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2024-10-31 22:01:51,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2024-10-31 22:01:51,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2024-10-31 22:01:51,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:51,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-10-31 22:01:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2024-10-31 22:01:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-31 22:01:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2024-10-31 22:01:51,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-10-31 22:01:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,291 INFO L425 stractBuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2024-10-31 22:01:51,291 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-31 22:01:51,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2024-10-31 22:01:51,293 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2024-10-31 22:01:51,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:51,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:51,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:51,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,298 INFO L745 eck$LassoCheckResult]: Stem: 1049#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1050#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1056#L225-1 [2024-10-31 22:01:51,299 INFO L747 eck$LassoCheckResult]: Loop: 1056#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1133#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1129#L93 assume !(0 != main_~p1~0#1); 1123#L93-2 assume !(0 != main_~p2~0#1); 1120#L97-1 assume !(0 != main_~p3~0#1); 1114#L101-1 assume !(0 != main_~p4~0#1); 1115#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1259#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1257#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1255#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1253#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1251#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1249#L129-1 assume !(0 != main_~p11~0#1); 1247#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1246#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1243#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1241#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1239#L149-1 assume !(0 != main_~p1~0#1); 1238#L155-1 assume !(0 != main_~p2~0#1); 1237#L160-1 assume !(0 != main_~p3~0#1); 1233#L165-1 assume !(0 != main_~p4~0#1); 1234#L170-1 assume !(0 != main_~p5~0#1); 1228#L175-1 assume !(0 != main_~p6~0#1); 1220#L180-1 assume !(0 != main_~p7~0#1); 1196#L185-1 assume !(0 != main_~p8~0#1); 1171#L190-1 assume !(0 != main_~p9~0#1); 1169#L195-1 assume !(0 != main_~p10~0#1); 1167#L200-1 assume !(0 != main_~p11~0#1); 1165#L205-1 assume !(0 != main_~p12~0#1); 1163#L210-1 assume !(0 != main_~p13~0#1); 1147#L215-1 assume !(0 != main_~p14~0#1); 1143#L220-1 assume !(0 != main_~p15~0#1); 1056#L225-1 [2024-10-31 22:01:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-31 22:01:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961751767] [2024-10-31 22:01:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:51,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2024-10-31 22:01:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526322200] [2024-10-31 22:01:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:51,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526322200] [2024-10-31 22:01:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526322200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:51,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652713286] [2024-10-31 22:01:51,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,422 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:51,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,424 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:51,447 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2024-10-31 22:01:51,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2024-10-31 22:01:51,454 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-10-31 22:01:51,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2024-10-31 22:01:51,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2024-10-31 22:01:51,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2024-10-31 22:01:51,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2024-10-31 22:01:51,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:51,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-10-31 22:01:51,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2024-10-31 22:01:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-10-31 22:01:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2024-10-31 22:01:51,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-10-31 22:01:51,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,502 INFO L425 stractBuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2024-10-31 22:01:51,502 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-31 22:01:51,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2024-10-31 22:01:51,507 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2024-10-31 22:01:51,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:51,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:51,508 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:51,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,509 INFO L745 eck$LassoCheckResult]: Stem: 2146#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 2147#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2113#L225-1 [2024-10-31 22:01:51,509 INFO L747 eck$LassoCheckResult]: Loop: 2113#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2152#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2153#L93 assume !(0 != main_~p1~0#1); 2564#L93-2 assume !(0 != main_~p2~0#1); 2558#L97-1 assume !(0 != main_~p3~0#1); 2526#L101-1 assume !(0 != main_~p4~0#1); 2528#L105-1 assume !(0 != main_~p5~0#1); 2556#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2554#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2552#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2550#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2548#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2546#L129-1 assume !(0 != main_~p11~0#1); 2544#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2542#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2540#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2538#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2536#L149-1 assume !(0 != main_~p1~0#1); 2490#L155-1 assume !(0 != main_~p2~0#1); 2491#L160-1 assume !(0 != main_~p3~0#1); 2623#L165-1 assume !(0 != main_~p4~0#1); 2482#L170-1 assume !(0 != main_~p5~0#1); 2479#L175-1 assume !(0 != main_~p6~0#1); 2478#L180-1 assume !(0 != main_~p7~0#1); 2158#L185-1 assume !(0 != main_~p8~0#1); 2117#L190-1 assume !(0 != main_~p9~0#1); 2628#L195-1 assume !(0 != main_~p10~0#1); 2124#L200-1 assume !(0 != main_~p11~0#1); 2125#L205-1 assume !(0 != main_~p12~0#1); 2140#L210-1 assume !(0 != main_~p13~0#1); 2108#L215-1 assume !(0 != main_~p14~0#1); 2109#L220-1 assume !(0 != main_~p15~0#1); 2113#L225-1 [2024-10-31 22:01:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,510 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-31 22:01:51,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509299265] [2024-10-31 22:01:51,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:51,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2024-10-31 22:01:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635265224] [2024-10-31 22:01:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635265224] [2024-10-31 22:01:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635265224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:51,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819691171] [2024-10-31 22:01:51,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,582 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:51,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,583 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:51,609 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2024-10-31 22:01:51,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2024-10-31 22:01:51,647 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-10-31 22:01:51,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2024-10-31 22:01:51,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2024-10-31 22:01:51,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2024-10-31 22:01:51,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2024-10-31 22:01:51,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:51,661 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-10-31 22:01:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2024-10-31 22:01:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2024-10-31 22:01:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2024-10-31 22:01:51,712 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-10-31 22:01:51,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,715 INFO L425 stractBuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2024-10-31 22:01:51,715 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-31 22:01:51,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2024-10-31 22:01:51,724 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2024-10-31 22:01:51,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:51,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:51,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:51,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,726 INFO L745 eck$LassoCheckResult]: Stem: 4300#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 4301#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4307#L225-1 [2024-10-31 22:01:51,726 INFO L747 eck$LassoCheckResult]: Loop: 4307#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4522#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4523#L93 assume !(0 != main_~p1~0#1); 4733#L93-2 assume !(0 != main_~p2~0#1); 4732#L97-1 assume !(0 != main_~p3~0#1); 4730#L101-1 assume !(0 != main_~p4~0#1); 4727#L105-1 assume !(0 != main_~p5~0#1); 4723#L109-1 assume !(0 != main_~p6~0#1); 4721#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4719#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4717#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4715#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4713#L129-1 assume !(0 != main_~p11~0#1); 4711#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4709#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4707#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4705#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4702#L149-1 assume !(0 != main_~p1~0#1); 4703#L155-1 assume !(0 != main_~p2~0#1); 4752#L160-1 assume !(0 != main_~p3~0#1); 4651#L165-1 assume !(0 != main_~p4~0#1); 4652#L170-1 assume !(0 != main_~p5~0#1); 4639#L175-1 assume !(0 != main_~p6~0#1); 4641#L180-1 assume !(0 != main_~p7~0#1); 4625#L185-1 assume !(0 != main_~p8~0#1); 4626#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4596#L205-1 assume !(0 != main_~p12~0#1); 4588#L210-1 assume !(0 != main_~p13~0#1); 4587#L215-1 assume !(0 != main_~p14~0#1); 4543#L220-1 assume !(0 != main_~p15~0#1); 4307#L225-1 [2024-10-31 22:01:51,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-10-31 22:01:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878989777] [2024-10-31 22:01:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:51,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2024-10-31 22:01:51,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22708114] [2024-10-31 22:01:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22708114] [2024-10-31 22:01:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22708114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464590612] [2024-10-31 22:01:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,818 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:51,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,820 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:51,856 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2024-10-31 22:01:51,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2024-10-31 22:01:51,891 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-10-31 22:01:51,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2024-10-31 22:01:51,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2024-10-31 22:01:51,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2024-10-31 22:01:51,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2024-10-31 22:01:51,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:51,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-10-31 22:01:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2024-10-31 22:01:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2024-10-31 22:01:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2024-10-31 22:01:51,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-10-31 22:01:51,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,976 INFO L425 stractBuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2024-10-31 22:01:51,977 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-31 22:01:51,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2024-10-31 22:01:51,993 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2024-10-31 22:01:51,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:51,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:51,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:51,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,997 INFO L745 eck$LassoCheckResult]: Stem: 8551#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8552#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2024-10-31 22:01:51,998 INFO L747 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8715#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8713#L93 assume !(0 != main_~p1~0#1); 8712#L93-2 assume !(0 != main_~p2~0#1); 8706#L97-1 assume !(0 != main_~p3~0#1); 8707#L101-1 assume !(0 != main_~p4~0#1); 8813#L105-1 assume !(0 != main_~p5~0#1); 8810#L109-1 assume !(0 != main_~p6~0#1); 8806#L113-1 assume !(0 != main_~p7~0#1); 8804#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8803#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8800#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8797#L129-1 assume !(0 != main_~p11~0#1); 8794#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8790#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8786#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8781#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8775#L149-1 assume !(0 != main_~p1~0#1); 8769#L155-1 assume !(0 != main_~p2~0#1); 8764#L160-1 assume !(0 != main_~p3~0#1); 8757#L165-1 assume !(0 != main_~p4~0#1); 8751#L170-1 assume !(0 != main_~p5~0#1); 8746#L175-1 assume !(0 != main_~p6~0#1); 8744#L180-1 assume !(0 != main_~p7~0#1); 8738#L185-1 assume !(0 != main_~p8~0#1); 8735#L190-1 assume !(0 != main_~p9~0#1); 8731#L195-1 assume !(0 != main_~p10~0#1); 8725#L200-1 assume !(0 != main_~p11~0#1); 8723#L205-1 assume !(0 != main_~p12~0#1); 8721#L210-1 assume !(0 != main_~p13~0#1); 8719#L215-1 assume !(0 != main_~p14~0#1); 8717#L220-1 assume !(0 != main_~p15~0#1); 8558#L225-1 [2024-10-31 22:01:51,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,998 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-10-31 22:01:51,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091441003] [2024-10-31 22:01:51,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:52,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:52,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2024-10-31 22:01:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497011728] [2024-10-31 22:01:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:52,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497011728] [2024-10-31 22:01:52,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497011728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:52,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:52,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744685924] [2024-10-31 22:01:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:52,068 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:52,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:52,071 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:52,117 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2024-10-31 22:01:52,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2024-10-31 22:01:52,219 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-10-31 22:01:52,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2024-10-31 22:01:52,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2024-10-31 22:01:52,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2024-10-31 22:01:52,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2024-10-31 22:01:52,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:52,273 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-10-31 22:01:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2024-10-31 22:01:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2024-10-31 22:01:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2024-10-31 22:01:52,414 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-10-31 22:01:52,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:52,417 INFO L425 stractBuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2024-10-31 22:01:52,418 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-31 22:01:52,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2024-10-31 22:01:52,444 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2024-10-31 22:01:52,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:52,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:52,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:52,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:52,446 INFO L745 eck$LassoCheckResult]: Stem: 16942#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16943#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2024-10-31 22:01:52,446 INFO L747 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17204#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17198#L93 assume !(0 != main_~p1~0#1); 17194#L93-2 assume !(0 != main_~p2~0#1); 17191#L97-1 assume !(0 != main_~p3~0#1); 17185#L101-1 assume !(0 != main_~p4~0#1); 17179#L105-1 assume !(0 != main_~p5~0#1); 17175#L109-1 assume !(0 != main_~p6~0#1); 17170#L113-1 assume !(0 != main_~p7~0#1); 17164#L117-1 assume !(0 != main_~p8~0#1); 17165#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17152#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17153#L129-1 assume !(0 != main_~p11~0#1); 17144#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17145#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17136#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17137#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17126#L149-1 assume !(0 != main_~p1~0#1); 17127#L155-1 assume !(0 != main_~p2~0#1); 17116#L160-1 assume !(0 != main_~p3~0#1); 17115#L165-1 assume !(0 != main_~p4~0#1); 17102#L170-1 assume !(0 != main_~p5~0#1); 17103#L175-1 assume !(0 != main_~p6~0#1); 17093#L180-1 assume !(0 != main_~p7~0#1); 17094#L185-1 assume !(0 != main_~p8~0#1); 17246#L190-1 assume !(0 != main_~p9~0#1); 17242#L195-1 assume !(0 != main_~p10~0#1); 17238#L200-1 assume !(0 != main_~p11~0#1); 17232#L205-1 assume !(0 != main_~p12~0#1); 17226#L210-1 assume !(0 != main_~p13~0#1); 17220#L215-1 assume !(0 != main_~p14~0#1); 17214#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2024-10-31 22:01:52,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-10-31 22:01:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310739261] [2024-10-31 22:01:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:52,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:52,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:52,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2024-10-31 22:01:52,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:52,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837891051] [2024-10-31 22:01:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:52,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:52,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837891051] [2024-10-31 22:01:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837891051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:52,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:52,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79130494] [2024-10-31 22:01:52,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:52,509 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:52,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:52,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:52,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:52,509 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:52,580 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2024-10-31 22:01:52,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2024-10-31 22:01:52,721 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-10-31 22:01:52,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2024-10-31 22:01:52,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2024-10-31 22:01:52,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2024-10-31 22:01:52,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2024-10-31 22:01:52,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:52,801 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-10-31 22:01:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2024-10-31 22:01:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2024-10-31 22:01:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2024-10-31 22:01:53,088 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-10-31 22:01:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:53,090 INFO L425 stractBuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2024-10-31 22:01:53,091 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-31 22:01:53,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2024-10-31 22:01:53,201 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2024-10-31 22:01:53,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:53,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:53,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:53,202 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:53,202 INFO L745 eck$LassoCheckResult]: Stem: 33526#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33527#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33531#L225-1 [2024-10-31 22:01:53,204 INFO L747 eck$LassoCheckResult]: Loop: 33531#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33939#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 33933#L93 assume !(0 != main_~p1~0#1); 33809#L93-2 assume !(0 != main_~p2~0#1); 33799#L97-1 assume !(0 != main_~p3~0#1); 33791#L101-1 assume !(0 != main_~p4~0#1); 33780#L105-1 assume !(0 != main_~p5~0#1); 33770#L109-1 assume !(0 != main_~p6~0#1); 33763#L113-1 assume !(0 != main_~p7~0#1); 33759#L117-1 assume !(0 != main_~p8~0#1); 33754#L121-1 assume !(0 != main_~p9~0#1); 33750#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33747#L129-1 assume !(0 != main_~p11~0#1); 33744#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33741#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33737#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33738#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33970#L149-1 assume !(0 != main_~p1~0#1); 33966#L155-1 assume !(0 != main_~p2~0#1); 33963#L160-1 assume !(0 != main_~p3~0#1); 33958#L165-1 assume !(0 != main_~p4~0#1); 33944#L170-1 assume !(0 != main_~p5~0#1); 33934#L175-1 assume !(0 != main_~p6~0#1); 33936#L180-1 assume !(0 != main_~p7~0#1); 34036#L185-1 assume !(0 != main_~p8~0#1); 34034#L190-1 assume !(0 != main_~p9~0#1); 34033#L195-1 assume !(0 != main_~p10~0#1); 34031#L200-1 assume !(0 != main_~p11~0#1); 34029#L205-1 assume !(0 != main_~p12~0#1); 34027#L210-1 assume !(0 != main_~p13~0#1); 33978#L215-1 assume !(0 != main_~p14~0#1); 33955#L220-1 assume !(0 != main_~p15~0#1); 33531#L225-1 [2024-10-31 22:01:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-10-31 22:01:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523573978] [2024-10-31 22:01:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:53,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:53,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:53,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2024-10-31 22:01:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:53,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371139679] [2024-10-31 22:01:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:53,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:53,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371139679] [2024-10-31 22:01:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371139679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:53,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382919516] [2024-10-31 22:01:53,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:53,262 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:53,263 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:53,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:53,418 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2024-10-31 22:01:53,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2024-10-31 22:01:53,545 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-10-31 22:01:53,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2024-10-31 22:01:53,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2024-10-31 22:01:53,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2024-10-31 22:01:53,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2024-10-31 22:01:53,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:53,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-10-31 22:01:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2024-10-31 22:01:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2024-10-31 22:01:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2024-10-31 22:01:54,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-10-31 22:01:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:54,235 INFO L425 stractBuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2024-10-31 22:01:54,235 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-31 22:01:54,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2024-10-31 22:01:54,307 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2024-10-31 22:01:54,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:54,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:54,308 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:54,308 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:54,308 INFO L745 eck$LassoCheckResult]: Stem: 66304#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 66305#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2024-10-31 22:01:54,309 INFO L747 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66961#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66959#L93 assume !(0 != main_~p1~0#1); 66957#L93-2 assume !(0 != main_~p2~0#1); 66956#L97-1 assume !(0 != main_~p3~0#1); 66954#L101-1 assume !(0 != main_~p4~0#1); 66952#L105-1 assume !(0 != main_~p5~0#1); 66951#L109-1 assume !(0 != main_~p6~0#1); 66949#L113-1 assume !(0 != main_~p7~0#1); 66947#L117-1 assume !(0 != main_~p8~0#1); 66945#L121-1 assume !(0 != main_~p9~0#1); 66943#L125-1 assume !(0 != main_~p10~0#1); 66941#L129-1 assume !(0 != main_~p11~0#1); 66940#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66938#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66935#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66905#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66900#L149-1 assume !(0 != main_~p1~0#1); 66897#L155-1 assume !(0 != main_~p2~0#1); 66896#L160-1 assume !(0 != main_~p3~0#1); 66891#L165-1 assume !(0 != main_~p4~0#1); 66705#L170-1 assume !(0 != main_~p5~0#1); 66706#L175-1 assume !(0 != main_~p6~0#1); 66697#L180-1 assume !(0 != main_~p7~0#1); 66698#L185-1 assume !(0 != main_~p8~0#1); 66833#L190-1 assume !(0 != main_~p9~0#1); 66835#L195-1 assume !(0 != main_~p10~0#1); 66877#L200-1 assume !(0 != main_~p11~0#1); 66872#L205-1 assume !(0 != main_~p12~0#1); 66871#L210-1 assume !(0 != main_~p13~0#1); 66965#L215-1 assume !(0 != main_~p14~0#1); 66963#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2024-10-31 22:01:54,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-10-31 22:01:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072123369] [2024-10-31 22:01:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:54,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:54,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2024-10-31 22:01:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:54,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491609654] [2024-10-31 22:01:54,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491609654] [2024-10-31 22:01:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491609654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:54,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:54,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913996577] [2024-10-31 22:01:54,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:54,366 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:54,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:54,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:54,367 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:54,570 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2024-10-31 22:01:54,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2024-10-31 22:01:54,993 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-10-31 22:01:55,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2024-10-31 22:01:55,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2024-10-31 22:01:55,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2024-10-31 22:01:55,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2024-10-31 22:01:55,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:55,389 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-10-31 22:01:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2024-10-31 22:01:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2024-10-31 22:01:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2024-10-31 22:01:56,369 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-10-31 22:01:56,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:56,371 INFO L425 stractBuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2024-10-31 22:01:56,371 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-31 22:01:56,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2024-10-31 22:01:56,702 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2024-10-31 22:01:56,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:56,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:56,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:56,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:56,705 INFO L745 eck$LassoCheckResult]: Stem: 131083#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131084#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131090#L225-1 [2024-10-31 22:01:56,706 INFO L747 eck$LassoCheckResult]: Loop: 131090#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131931#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 131932#L93 assume !(0 != main_~p1~0#1); 131905#L93-2 assume !(0 != main_~p2~0#1); 131907#L97-1 assume !(0 != main_~p3~0#1); 131892#L101-1 assume !(0 != main_~p4~0#1); 131894#L105-1 assume !(0 != main_~p5~0#1); 132109#L109-1 assume !(0 != main_~p6~0#1); 132105#L113-1 assume !(0 != main_~p7~0#1); 132101#L117-1 assume !(0 != main_~p8~0#1); 132098#L121-1 assume !(0 != main_~p9~0#1); 132095#L125-1 assume !(0 != main_~p10~0#1); 132092#L129-1 assume !(0 != main_~p11~0#1); 132053#L133-1 assume !(0 != main_~p12~0#1); 132054#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 132056#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132051#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132022#L149-1 assume !(0 != main_~p1~0#1); 132023#L155-1 assume !(0 != main_~p2~0#1); 132108#L160-1 assume !(0 != main_~p3~0#1); 132103#L165-1 assume !(0 != main_~p4~0#1); 132100#L170-1 assume !(0 != main_~p5~0#1); 132097#L175-1 assume !(0 != main_~p6~0#1); 132093#L180-1 assume !(0 != main_~p7~0#1); 132091#L185-1 assume !(0 != main_~p8~0#1); 132088#L190-1 assume !(0 != main_~p9~0#1); 132086#L195-1 assume !(0 != main_~p10~0#1); 132083#L200-1 assume !(0 != main_~p11~0#1); 132081#L205-1 assume !(0 != main_~p12~0#1); 132080#L210-1 assume !(0 != main_~p13~0#1); 132078#L215-1 assume !(0 != main_~p14~0#1); 131939#L220-1 assume !(0 != main_~p15~0#1); 131090#L225-1 [2024-10-31 22:01:56,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:56,706 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2024-10-31 22:01:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:56,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176721196] [2024-10-31 22:01:56,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:56,712 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:01:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:01:56,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:01:56,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2024-10-31 22:01:56,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:56,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708181296] [2024-10-31 22:01:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:56,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708181296] [2024-10-31 22:01:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708181296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505005445] [2024-10-31 22:01:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:56,763 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:01:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:56,764 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:01:57,179 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2024-10-31 22:01:57,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2024-10-31 22:01:57,633 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-10-31 22:01:57,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2024-10-31 22:01:57,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2024-10-31 22:01:57,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2024-10-31 22:01:57,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2024-10-31 22:01:58,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:01:58,052 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-10-31 22:01:58,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2024-10-31 22:01:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2024-10-31 22:01:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:01:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2024-10-31 22:01:59,400 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-10-31 22:01:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:59,401 INFO L425 stractBuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2024-10-31 22:01:59,401 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-31 22:01:59,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2024-10-31 22:01:59,995 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2024-10-31 22:01:59,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:01:59,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:01:59,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:01:59,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:59,996 INFO L745 eck$LassoCheckResult]: Stem: 259091#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 259092#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2024-10-31 22:01:59,996 INFO L747 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 259378#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 259376#L93 assume !(0 != main_~p1~0#1); 259374#L93-2 assume !(0 != main_~p2~0#1); 259373#L97-1 assume !(0 != main_~p3~0#1); 259371#L101-1 assume !(0 != main_~p4~0#1); 259369#L105-1 assume !(0 != main_~p5~0#1); 259367#L109-1 assume !(0 != main_~p6~0#1); 259365#L113-1 assume !(0 != main_~p7~0#1); 259363#L117-1 assume !(0 != main_~p8~0#1); 259361#L121-1 assume !(0 != main_~p9~0#1); 259238#L125-1 assume !(0 != main_~p10~0#1); 259184#L129-1 assume !(0 != main_~p11~0#1); 259185#L133-1 assume !(0 != main_~p12~0#1); 259359#L137-1 assume !(0 != main_~p13~0#1); 259356#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 259354#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 259351#L149-1 assume !(0 != main_~p1~0#1); 259347#L155-1 assume !(0 != main_~p2~0#1); 259344#L160-1 assume !(0 != main_~p3~0#1); 259339#L165-1 assume !(0 != main_~p4~0#1); 259335#L170-1 assume !(0 != main_~p5~0#1); 259330#L175-1 assume !(0 != main_~p6~0#1); 259324#L180-1 assume !(0 != main_~p7~0#1); 259319#L185-1 assume !(0 != main_~p8~0#1); 259313#L190-1 assume !(0 != main_~p9~0#1); 259307#L195-1 assume !(0 != main_~p10~0#1); 259235#L200-1 assume !(0 != main_~p11~0#1); 259234#L205-1 assume !(0 != main_~p12~0#1); 259297#L210-1 assume !(0 != main_~p13~0#1); 259382#L215-1 assume !(0 != main_~p14~0#1); 259380#L220-1 assume !(0 != main_~p15~0#1); 259099#L225-1 [2024-10-31 22:01:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2024-10-31 22:01:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973153456] [2024-10-31 22:01:59,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:00,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:00,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:00,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2024-10-31 22:02:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713761086] [2024-10-31 22:02:00,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713761086] [2024-10-31 22:02:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713761086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:00,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:02:00,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783834007] [2024-10-31 22:02:00,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:00,053 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:02:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:00,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:00,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:00,055 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:00,819 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2024-10-31 22:02:00,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2024-10-31 22:02:01,606 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2024-10-31 22:02:02,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2024-10-31 22:02:02,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2024-10-31 22:02:02,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2024-10-31 22:02:02,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2024-10-31 22:02:02,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:02:02,672 INFO L218 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-10-31 22:02:02,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2024-10-31 22:02:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2024-10-31 22:02:04,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2024-10-31 22:02:05,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-10-31 22:02:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:05,520 INFO L425 stractBuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2024-10-31 22:02:05,520 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-31 22:02:05,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2024-10-31 22:02:05,889 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2024-10-31 22:02:05,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:02:05,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:02:05,891 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:02:05,891 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:05,891 INFO L745 eck$LassoCheckResult]: Stem: 512033#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 512034#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512043#L225-1 [2024-10-31 22:02:05,891 INFO L747 eck$LassoCheckResult]: Loop: 512043#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 513169#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 513166#L93 assume !(0 != main_~p1~0#1); 513160#L93-2 assume !(0 != main_~p2~0#1); 513155#L97-1 assume !(0 != main_~p3~0#1); 513152#L101-1 assume !(0 != main_~p4~0#1); 513149#L105-1 assume !(0 != main_~p5~0#1); 513141#L109-1 assume !(0 != main_~p6~0#1); 513143#L113-1 assume !(0 != main_~p7~0#1); 513131#L117-1 assume !(0 != main_~p8~0#1); 513133#L121-1 assume !(0 != main_~p9~0#1); 513121#L125-1 assume !(0 != main_~p10~0#1); 513123#L129-1 assume !(0 != main_~p11~0#1); 513114#L133-1 assume !(0 != main_~p12~0#1); 513115#L137-1 assume !(0 != main_~p13~0#1); 513091#L141-1 assume !(0 != main_~p14~0#1); 513089#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 513090#L149-1 assume !(0 != main_~p1~0#1); 513250#L155-1 assume !(0 != main_~p2~0#1); 513245#L160-1 assume !(0 != main_~p3~0#1); 513238#L165-1 assume !(0 != main_~p4~0#1); 513232#L170-1 assume !(0 != main_~p5~0#1); 513224#L175-1 assume !(0 != main_~p6~0#1); 513216#L180-1 assume !(0 != main_~p7~0#1); 513208#L185-1 assume !(0 != main_~p8~0#1); 513204#L190-1 assume !(0 != main_~p9~0#1); 513199#L195-1 assume !(0 != main_~p10~0#1); 513194#L200-1 assume !(0 != main_~p11~0#1); 513191#L205-1 assume !(0 != main_~p12~0#1); 513189#L210-1 assume !(0 != main_~p13~0#1); 513186#L215-1 assume !(0 != main_~p14~0#1); 513182#L220-1 assume !(0 != main_~p15~0#1); 512043#L225-1 [2024-10-31 22:02:05,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2024-10-31 22:02:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:05,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662507752] [2024-10-31 22:02:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:05,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:05,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:05,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:05,904 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2024-10-31 22:02:05,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:05,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611105334] [2024-10-31 22:02:05,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:05,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:02:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:05,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611105334] [2024-10-31 22:02:05,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611105334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:02:05,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:02:05,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:02:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268637632] [2024-10-31 22:02:05,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:02:05,929 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 22:02:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:02:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:02:05,930 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:02:07,377 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2024-10-31 22:02:07,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2024-10-31 22:02:09,536 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2024-10-31 22:02:10,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2024-10-31 22:02:10,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2024-10-31 22:02:11,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2024-10-31 22:02:11,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2024-10-31 22:02:11,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 22:02:11,320 INFO L218 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-10-31 22:02:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2024-10-31 22:02:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2024-10-31 22:02:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:02:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2024-10-31 22:02:16,875 INFO L240 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-10-31 22:02:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:02:16,877 INFO L425 stractBuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2024-10-31 22:02:16,877 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-10-31 22:02:16,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2024-10-31 22:02:17,586 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2024-10-31 22:02:17,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 22:02:17,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 22:02:17,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-31 22:02:17,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:17,590 INFO L745 eck$LassoCheckResult]: Stem: 1011755#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1011756#L-1 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_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#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_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~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_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_#t~nondet15#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_#t~nondet16#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;havoc main_#t~nondet17#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_#t~nondet18#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011761#L225-1 [2024-10-31 22:02:17,590 INFO L747 eck$LassoCheckResult]: Loop: 1011761#L225-1 assume !false;havoc main_#t~nondet19#1;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012022#L58 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;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1012017#L93 assume !(0 != main_~p1~0#1); 1012010#L93-2 assume !(0 != main_~p2~0#1); 1012003#L97-1 assume !(0 != main_~p3~0#1); 1011997#L101-1 assume !(0 != main_~p4~0#1); 1011990#L105-1 assume !(0 != main_~p5~0#1); 1011982#L109-1 assume !(0 != main_~p6~0#1); 1011974#L113-1 assume !(0 != main_~p7~0#1); 1011964#L117-1 assume !(0 != main_~p8~0#1); 1011965#L121-1 assume !(0 != main_~p9~0#1); 1012113#L125-1 assume !(0 != main_~p10~0#1); 1012111#L129-1 assume !(0 != main_~p11~0#1); 1012107#L133-1 assume !(0 != main_~p12~0#1); 1012103#L137-1 assume !(0 != main_~p13~0#1); 1012099#L141-1 assume !(0 != main_~p14~0#1); 1012095#L145-1 assume !(0 != main_~p15~0#1); 1012091#L149-1 assume !(0 != main_~p1~0#1); 1012087#L155-1 assume !(0 != main_~p2~0#1); 1012084#L160-1 assume !(0 != main_~p3~0#1); 1012079#L165-1 assume !(0 != main_~p4~0#1); 1012075#L170-1 assume !(0 != main_~p5~0#1); 1012071#L175-1 assume !(0 != main_~p6~0#1); 1012067#L180-1 assume !(0 != main_~p7~0#1); 1012065#L185-1 assume !(0 != main_~p8~0#1); 1012062#L190-1 assume !(0 != main_~p9~0#1); 1012058#L195-1 assume !(0 != main_~p10~0#1); 1012055#L200-1 assume !(0 != main_~p11~0#1); 1012051#L205-1 assume !(0 != main_~p12~0#1); 1012046#L210-1 assume !(0 != main_~p13~0#1); 1012040#L215-1 assume !(0 != main_~p14~0#1); 1012033#L220-1 assume !(0 != main_~p15~0#1); 1011761#L225-1 [2024-10-31 22:02:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2024-10-31 22:02:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245611815] [2024-10-31 22:02:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:17,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:17,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2024-10-31 22:02:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769306142] [2024-10-31 22:02:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:18,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:18,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:02:18,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2024-10-31 22:02:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:18,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086784714] [2024-10-31 22:02:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:18,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:02:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:02:18,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace