./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version a0165632
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_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 19:15:06,513 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 19:15:06,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-08 19:15:06,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 19:15:06,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 19:15:06,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 19:15:06,671 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 19:15:06,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 19:15:06,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 19:15:06,696 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 19:15:06,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 19:15:06,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 19:15:06,699 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 19:15:06,705 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-08 19:15:06,705 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-08 19:15:06,706 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-08 19:15:06,706 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-08 19:15:06,706 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-08 19:15:06,707 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-08 19:15:06,707 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 19:15:06,707 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-08 19:15:06,708 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 19:15:06,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 19:15:06,713 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 19:15:06,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 19:15:06,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-08 19:15:06,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-08 19:15:06,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-08 19:15:06,714 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 19:15:06,715 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 19:15:06,715 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 19:15:06,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 19:15:06,715 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-08 19:15:06,716 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 19:15:06,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 19:15:06,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 19:15:06,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 19:15:06,718 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 19:15:06,719 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-08 19:15:06,720 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_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/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_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b
[2024-11-08 19:15:07,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 19:15:07,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 19:15:07,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 19:15:07,094 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 19:15:07,095 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 19:15:07,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/locks/test_locks_10.c
Unable to find full path for "g++"
[2024-11-08 19:15:09,132 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 19:15:09,340 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 19:15:09,341 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/sv-benchmarks/c/locks/test_locks_10.c
[2024-11-08 19:15:09,355 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/data/fa9602861/05c296f0fa3742d593163d965a60a557/FLAG4327ac0f4
[2024-11-08 19:15:09,726 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/data/fa9602861/05c296f0fa3742d593163d965a60a557
[2024-11-08 19:15:09,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 19:15:09,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 19:15:09,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 19:15:09,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 19:15:09,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 19:15:09,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:09" (1/1) ...
[2024-11-08 19:15:09,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8d9bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:09, skipping insertion in model container
[2024-11-08 19:15:09,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:09" (1/1) ...
[2024-11-08 19:15:09,792 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 19:15:10,019 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:15:10,031 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 19:15:10,057 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 19:15:10,072 INFO L204 MainTranslator]: Completed translation
[2024-11-08 19:15:10,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10 WrapperNode
[2024-11-08 19:15:10,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 19:15:10,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 19:15:10,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 19:15:10,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 19:15:10,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,107 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137
[2024-11-08 19:15:10,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 19:15:10,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 19:15:10,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 19:15:10,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 19:15:10,121 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,123 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,136 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 19:15:10,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,150 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 19:15:10,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 19:15:10,152 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 19:15:10,152 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 19:15:10,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (1/1) ...
[2024-11-08 19:15:10,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 19:15:10,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 19:15:10,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 19:15:10,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-08 19:15:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 19:15:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 19:15:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 19:15:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 19:15:10,295 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 19:15:10,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 19:15:10,610 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live.
[2024-11-08 19:15:10,611 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 19:15:10,625 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 19:15:10,625 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 19:15:10,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:10 BoogieIcfgContainer
[2024-11-08 19:15:10,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 19:15:10,627 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-08 19:15:10,627 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-08 19:15:10,630 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-08 19:15:10,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 19:15:10,631 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 07:15:09" (1/3) ...
[2024-11-08 19:15:10,632 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bc276dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 07:15:10, skipping insertion in model container
[2024-11-08 19:15:10,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 19:15:10,632 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:10" (2/3) ...
[2024-11-08 19:15:10,632 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4bc276dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 07:15:10, skipping insertion in model container
[2024-11-08 19:15:10,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 19:15:10,633 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:10" (3/3) ...
[2024-11-08 19:15:10,634 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_10.c
[2024-11-08 19:15:10,689 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-08 19:15:10,689 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-08 19:15:10,689 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-08 19:15:10,689 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-08 19:15:10,689 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-08 19:15:10,689 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-08 19:15:10,689 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-08 19:15:10,690 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-08 19:15:10,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:10,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32
[2024-11-08 19:15:10,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:10,712 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:10,716 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:10,716 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]
[2024-11-08 19:15:10,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-08 19:15:10,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:10,720 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32
[2024-11-08 19:15:10,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:10,721 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:10,721 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:10,721 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]
[2024-11-08 19:15:10,728 INFO L745 eck$LassoCheckResult]: Stem: 38#$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(16, 2);call #Ultimate.allocInit(12, 3); 8#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 28#L155-1true
[2024-11-08 19:15:10,729 INFO L747 eck$LassoCheckResult]: Loop: 28#L155-1true assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 25#L43true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 29#L68true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 9#L68-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 3#L72-1true assume !(0 != main_~p3~0#1); 19#L76-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 18#L80-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 30#L84-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 20#L88-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 6#L92-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4#L96-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 7#L100-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 39#L104-1true assume !(0 != main_~p1~0#1); 23#L110-1true assume !(0 != main_~p2~0#1); 33#L115-1true assume !(0 != main_~p3~0#1); 17#L120-1true assume !(0 != main_~p4~0#1); 27#L125-1true assume !(0 != main_~p5~0#1); 36#L130-1true assume !(0 != main_~p6~0#1); 15#L135-1true assume !(0 != main_~p7~0#1); 13#L140-1true assume !(0 != main_~p8~0#1); 40#L145-1true assume !(0 != main_~p9~0#1); 10#L150-1true assume !(0 != main_~p10~0#1); 28#L155-1true
[2024-11-08 19:15:10,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-08 19:15:10,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:10,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492947584]
[2024-11-08 19:15:10,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:10,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:10,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:10,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:10,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1844487545, now seen corresponding path program 1 times
[2024-11-08 19:15:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:10,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387936039]
[2024-11-08 19:15:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387936039]
[2024-11-08 19:15:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387936039] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039655335]
[2024-11-08 19:15:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:11,093 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:11,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:11,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:11,143 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:11,205 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions.
[2024-11-08 19:15:11,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 129 transitions.
[2024-11-08 19:15:11,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63
[2024-11-08 19:15:11,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 103 transitions.
[2024-11-08 19:15:11,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65
[2024-11-08 19:15:11,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65
[2024-11-08 19:15:11,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 103 transitions.
[2024-11-08 19:15:11,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:11,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions.
[2024-11-08 19:15:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 103 transitions.
[2024-11-08 19:15:11,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65.
[2024-11-08 19:15:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 64 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 103 transitions.
[2024-11-08 19:15:11,267 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 103 transitions.
[2024-11-08 19:15:11,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:11,274 INFO L425 stractBuchiCegarLoop]: Abstraction has 65 states and 103 transitions.
[2024-11-08 19:15:11,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-08 19:15:11,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 103 transitions.
[2024-11-08 19:15:11,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 63
[2024-11-08 19:15:11,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:11,278 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:11,278 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:11,279 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]
[2024-11-08 19:15:11,281 INFO L745 eck$LassoCheckResult]: Stem: 159#$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(16, 2);call #Ultimate.allocInit(12, 3); 130#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 131#L155-1
[2024-11-08 19:15:11,282 INFO L747 eck$LassoCheckResult]: Loop: 131#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 170#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 169#L68 assume !(0 != main_~p1~0#1); 168#L68-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 167#L72-1 assume !(0 != main_~p3~0#1); 166#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 165#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 164#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 147#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 128#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 124#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 125#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 129#L104-1 assume !(0 != main_~p1~0#1); 150#L110-1 assume !(0 != main_~p2~0#1); 151#L115-1 assume !(0 != main_~p3~0#1); 144#L120-1 assume !(0 != main_~p4~0#1); 127#L125-1 assume !(0 != main_~p5~0#1); 137#L130-1 assume !(0 != main_~p6~0#1); 143#L135-1 assume !(0 != main_~p7~0#1); 142#L140-1 assume !(0 != main_~p8~0#1); 174#L145-1 assume !(0 != main_~p9~0#1); 172#L150-1 assume !(0 != main_~p10~0#1); 131#L155-1
[2024-11-08 19:15:11,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2024-11-08 19:15:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553035622]
[2024-11-08 19:15:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:11,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1026839095, now seen corresponding path program 1 times
[2024-11-08 19:15:11,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535679892]
[2024-11-08 19:15:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:11,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:11,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535679892]
[2024-11-08 19:15:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535679892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672608361]
[2024-11-08 19:15:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:11,409 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:11,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:11,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:11,410 INFO L87 Difference]: Start difference. First operand 65 states and 103 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:11,453 INFO L93 Difference]: Finished difference Result 126 states and 198 transitions.
[2024-11-08 19:15:11,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 198 transitions.
[2024-11-08 19:15:11,455 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124
[2024-11-08 19:15:11,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 198 transitions.
[2024-11-08 19:15:11,461 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126
[2024-11-08 19:15:11,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126
[2024-11-08 19:15:11,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 198 transitions.
[2024-11-08 19:15:11,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:11,466 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions.
[2024-11-08 19:15:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 198 transitions.
[2024-11-08 19:15:11,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126.
[2024-11-08 19:15:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 126 states have (on average 1.5714285714285714) internal successors, (198), 125 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions.
[2024-11-08 19:15:11,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 126 states and 198 transitions.
[2024-11-08 19:15:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:11,485 INFO L425 stractBuchiCegarLoop]: Abstraction has 126 states and 198 transitions.
[2024-11-08 19:15:11,485 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-08 19:15:11,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 198 transitions.
[2024-11-08 19:15:11,487 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 124
[2024-11-08 19:15:11,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:11,487 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:11,488 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:11,488 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]
[2024-11-08 19:15:11,488 INFO L745 eck$LassoCheckResult]: Stem: 353#$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(16, 2);call #Ultimate.allocInit(12, 3); 327#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 328#L155-1
[2024-11-08 19:15:11,488 INFO L747 eck$LassoCheckResult]: Loop: 328#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 383#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 381#L68 assume !(0 != main_~p1~0#1); 378#L68-2 assume !(0 != main_~p2~0#1); 376#L72-1 assume !(0 != main_~p3~0#1); 374#L76-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 372#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 370#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 368#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 366#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 364#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 362#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 360#L104-1 assume !(0 != main_~p1~0#1); 356#L110-1 assume !(0 != main_~p2~0#1); 357#L115-1 assume !(0 != main_~p3~0#1); 414#L120-1 assume !(0 != main_~p4~0#1); 409#L125-1 assume !(0 != main_~p5~0#1); 406#L130-1 assume !(0 != main_~p6~0#1); 400#L135-1 assume !(0 != main_~p7~0#1); 396#L140-1 assume !(0 != main_~p8~0#1); 392#L145-1 assume !(0 != main_~p9~0#1); 388#L150-1 assume !(0 != main_~p10~0#1); 328#L155-1
[2024-11-08 19:15:11,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2024-11-08 19:15:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811579527]
[2024-11-08 19:15:11,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:11,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,505 INFO L85 PathProgramCache]: Analyzing trace with hash -662104647, now seen corresponding path program 1 times
[2024-11-08 19:15:11,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352928365]
[2024-11-08 19:15:11,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:11,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:11,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:11,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352928365]
[2024-11-08 19:15:11,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352928365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:11,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:11,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312379662]
[2024-11-08 19:15:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:11,600 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:11,601 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. cyclomatic complexity: 76 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:11,639 INFO L93 Difference]: Finished difference Result 246 states and 382 transitions.
[2024-11-08 19:15:11,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 246 states and 382 transitions.
[2024-11-08 19:15:11,644 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244
[2024-11-08 19:15:11,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 246 states to 246 states and 382 transitions.
[2024-11-08 19:15:11,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246
[2024-11-08 19:15:11,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 246
[2024-11-08 19:15:11,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 246 states and 382 transitions.
[2024-11-08 19:15:11,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:11,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions.
[2024-11-08 19:15:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states and 382 transitions.
[2024-11-08 19:15:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246.
[2024-11-08 19:15:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 246 states have (on average 1.5528455284552845) internal successors, (382), 245 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 382 transitions.
[2024-11-08 19:15:11,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 246 states and 382 transitions.
[2024-11-08 19:15:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:11,671 INFO L425 stractBuchiCegarLoop]: Abstraction has 246 states and 382 transitions.
[2024-11-08 19:15:11,671 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-08 19:15:11,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 382 transitions.
[2024-11-08 19:15:11,674 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 244
[2024-11-08 19:15:11,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:11,675 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:11,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:11,675 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]
[2024-11-08 19:15:11,676 INFO L745 eck$LassoCheckResult]: Stem: 733#$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(16, 2);call #Ultimate.allocInit(12, 3); 705#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 706#L155-1
[2024-11-08 19:15:11,676 INFO L747 eck$LassoCheckResult]: Loop: 706#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 780#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 776#L68 assume !(0 != main_~p1~0#1); 771#L68-2 assume !(0 != main_~p2~0#1); 765#L72-1 assume !(0 != main_~p3~0#1); 761#L76-1 assume !(0 != main_~p4~0#1); 755#L80-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 753#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 751#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 749#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 747#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 745#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 741#L104-1 assume !(0 != main_~p1~0#1); 736#L110-1 assume !(0 != main_~p2~0#1); 737#L115-1 assume !(0 != main_~p3~0#1); 837#L120-1 assume !(0 != main_~p4~0#1); 834#L125-1 assume !(0 != main_~p5~0#1); 831#L130-1 assume !(0 != main_~p6~0#1); 827#L135-1 assume !(0 != main_~p7~0#1); 823#L140-1 assume !(0 != main_~p8~0#1); 819#L145-1 assume !(0 != main_~p9~0#1); 815#L150-1 assume !(0 != main_~p10~0#1); 706#L155-1
[2024-11-08 19:15:11,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2024-11-08 19:15:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449713329]
[2024-11-08 19:15:11,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2044514747, now seen corresponding path program 1 times
[2024-11-08 19:15:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194145723]
[2024-11-08 19:15:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:11,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194145723]
[2024-11-08 19:15:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194145723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187224145]
[2024-11-08 19:15:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:11,777 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:11,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:11,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:11,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:11,779 INFO L87 Difference]: Start difference. First operand 246 states and 382 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:11,800 INFO L93 Difference]: Finished difference Result 482 states and 738 transitions.
[2024-11-08 19:15:11,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 738 transitions.
[2024-11-08 19:15:11,806 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480
[2024-11-08 19:15:11,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 738 transitions.
[2024-11-08 19:15:11,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482
[2024-11-08 19:15:11,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482
[2024-11-08 19:15:11,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 738 transitions.
[2024-11-08 19:15:11,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:11,821 INFO L218 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions.
[2024-11-08 19:15:11,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 738 transitions.
[2024-11-08 19:15:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482.
[2024-11-08 19:15:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.5311203319502074) internal successors, (738), 481 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 738 transitions.
[2024-11-08 19:15:11,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 482 states and 738 transitions.
[2024-11-08 19:15:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:11,872 INFO L425 stractBuchiCegarLoop]: Abstraction has 482 states and 738 transitions.
[2024-11-08 19:15:11,872 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-08 19:15:11,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 738 transitions.
[2024-11-08 19:15:11,877 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 480
[2024-11-08 19:15:11,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:11,878 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:11,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:11,880 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]
[2024-11-08 19:15:11,880 INFO L745 eck$LassoCheckResult]: Stem: 1474#$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(16, 2);call #Ultimate.allocInit(12, 3); 1439#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 1440#L155-1
[2024-11-08 19:15:11,881 INFO L747 eck$LassoCheckResult]: Loop: 1440#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1526#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 1521#L68 assume !(0 != main_~p1~0#1); 1513#L68-2 assume !(0 != main_~p2~0#1); 1506#L72-1 assume !(0 != main_~p3~0#1); 1502#L76-1 assume !(0 != main_~p4~0#1); 1495#L80-1 assume !(0 != main_~p5~0#1); 1496#L84-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1608#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1606#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1604#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1602#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1598#L104-1 assume !(0 != main_~p1~0#1); 1586#L110-1 assume !(0 != main_~p2~0#1); 1585#L115-1 assume !(0 != main_~p3~0#1); 1579#L120-1 assume !(0 != main_~p4~0#1); 1575#L125-1 assume !(0 != main_~p5~0#1); 1573#L130-1 assume !(0 != main_~p6~0#1); 1569#L135-1 assume !(0 != main_~p7~0#1); 1565#L140-1 assume !(0 != main_~p8~0#1); 1561#L145-1 assume !(0 != main_~p9~0#1); 1557#L150-1 assume !(0 != main_~p10~0#1); 1440#L155-1
[2024-11-08 19:15:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times
[2024-11-08 19:15:11,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038222026]
[2024-11-08 19:15:11,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,894 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:11,900 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:11,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1023446393, now seen corresponding path program 1 times
[2024-11-08 19:15:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49156222]
[2024-11-08 19:15:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:11,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:11,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49156222]
[2024-11-08 19:15:11,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49156222] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:11,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:11,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:11,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548495010]
[2024-11-08 19:15:11,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:11,934 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:11,937 INFO L87 Difference]: Start difference. First operand 482 states and 738 transitions. cyclomatic complexity: 272 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:11,966 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions.
[2024-11-08 19:15:11,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1426 transitions.
[2024-11-08 19:15:11,974 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944
[2024-11-08 19:15:11,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1426 transitions.
[2024-11-08 19:15:11,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946
[2024-11-08 19:15:11,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946
[2024-11-08 19:15:11,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1426 transitions.
[2024-11-08 19:15:11,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:11,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions.
[2024-11-08 19:15:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1426 transitions.
[2024-11-08 19:15:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 946.
[2024-11-08 19:15:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 946 states have (on average 1.507399577167019) internal successors, (1426), 945 states have internal predecessors, (1426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:12,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1426 transitions.
[2024-11-08 19:15:12,059 INFO L240 hiAutomatonCegarLoop]: Abstraction has 946 states and 1426 transitions.
[2024-11-08 19:15:12,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:12,061 INFO L425 stractBuchiCegarLoop]: Abstraction has 946 states and 1426 transitions.
[2024-11-08 19:15:12,061 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-08 19:15:12,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 946 states and 1426 transitions.
[2024-11-08 19:15:12,071 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 944
[2024-11-08 19:15:12,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:12,071 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:12,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:12,073 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]
[2024-11-08 19:15:12,074 INFO L745 eck$LassoCheckResult]: Stem: 2910#$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(16, 2);call #Ultimate.allocInit(12, 3); 2873#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 2874#L155-1
[2024-11-08 19:15:12,074 INFO L747 eck$LassoCheckResult]: Loop: 2874#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 3066#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 3064#L68 assume !(0 != main_~p1~0#1); 3062#L68-2 assume !(0 != main_~p2~0#1); 3061#L72-1 assume !(0 != main_~p3~0#1); 3060#L76-1 assume !(0 != main_~p4~0#1); 3058#L80-1 assume !(0 != main_~p5~0#1); 3056#L84-1 assume !(0 != main_~p6~0#1); 3050#L88-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3051#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3043#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3044#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3030#L104-1 assume !(0 != main_~p1~0#1); 3031#L110-1 assume !(0 != main_~p2~0#1); 3018#L115-1 assume !(0 != main_~p3~0#1); 3017#L120-1 assume !(0 != main_~p4~0#1); 3002#L125-1 assume !(0 != main_~p5~0#1); 3003#L130-1 assume !(0 != main_~p6~0#1); 3074#L135-1 assume !(0 != main_~p7~0#1); 3072#L140-1 assume !(0 != main_~p8~0#1); 3070#L145-1 assume !(0 != main_~p9~0#1); 3068#L150-1 assume !(0 != main_~p10~0#1); 2874#L155-1
[2024-11-08 19:15:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times
[2024-11-08 19:15:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:12,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397810806]
[2024-11-08 19:15:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:12,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:12,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:12,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -256417285, now seen corresponding path program 1 times
[2024-11-08 19:15:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:12,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233263462]
[2024-11-08 19:15:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:12,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233263462]
[2024-11-08 19:15:12,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233263462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:12,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:12,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662129215]
[2024-11-08 19:15:12,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:12,160 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:12,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:12,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:12,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:12,161 INFO L87 Difference]: Start difference. First operand 946 states and 1426 transitions. cyclomatic complexity: 512 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:12,192 INFO L93 Difference]: Finished difference Result 1858 states and 2754 transitions.
[2024-11-08 19:15:12,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1858 states and 2754 transitions.
[2024-11-08 19:15:12,215 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856
[2024-11-08 19:15:12,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1858 states to 1858 states and 2754 transitions.
[2024-11-08 19:15:12,231 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1858
[2024-11-08 19:15:12,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1858
[2024-11-08 19:15:12,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1858 states and 2754 transitions.
[2024-11-08 19:15:12,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:12,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions.
[2024-11-08 19:15:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states and 2754 transitions.
[2024-11-08 19:15:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1858.
[2024-11-08 19:15:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 1.4822389666307858) internal successors, (2754), 1857 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2754 transitions.
[2024-11-08 19:15:12,283 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1858 states and 2754 transitions.
[2024-11-08 19:15:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:12,284 INFO L425 stractBuchiCegarLoop]: Abstraction has 1858 states and 2754 transitions.
[2024-11-08 19:15:12,285 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-08 19:15:12,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1858 states and 2754 transitions.
[2024-11-08 19:15:12,299 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1856
[2024-11-08 19:15:12,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:12,299 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:12,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:12,301 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]
[2024-11-08 19:15:12,301 INFO L745 eck$LassoCheckResult]: Stem: 5722#$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(16, 2);call #Ultimate.allocInit(12, 3); 5683#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 5684#L155-1
[2024-11-08 19:15:12,301 INFO L747 eck$LassoCheckResult]: Loop: 5684#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 5881#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 5878#L68 assume !(0 != main_~p1~0#1); 5874#L68-2 assume !(0 != main_~p2~0#1); 5871#L72-1 assume !(0 != main_~p3~0#1); 5869#L76-1 assume !(0 != main_~p4~0#1); 5861#L80-1 assume !(0 != main_~p5~0#1); 5863#L84-1 assume !(0 != main_~p6~0#1); 5850#L88-1 assume !(0 != main_~p7~0#1); 5852#L92-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 5840#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 5841#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 5827#L104-1 assume !(0 != main_~p1~0#1); 5828#L110-1 assume !(0 != main_~p2~0#1); 5804#L115-1 assume !(0 != main_~p3~0#1); 5803#L120-1 assume !(0 != main_~p4~0#1); 5899#L125-1 assume !(0 != main_~p5~0#1); 5897#L130-1 assume !(0 != main_~p6~0#1); 5895#L135-1 assume !(0 != main_~p7~0#1); 5894#L140-1 assume !(0 != main_~p8~0#1); 5890#L145-1 assume !(0 != main_~p9~0#1); 5886#L150-1 assume !(0 != main_~p10~0#1); 5684#L155-1
[2024-11-08 19:15:12,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times
[2024-11-08 19:15:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122155452]
[2024-11-08 19:15:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:12,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:12,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:12,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1267534535, now seen corresponding path program 1 times
[2024-11-08 19:15:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170520011]
[2024-11-08 19:15:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170520011]
[2024-11-08 19:15:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170520011] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196878148]
[2024-11-08 19:15:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:12,373 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:12,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:12,376 INFO L87 Difference]: Start difference. First operand 1858 states and 2754 transitions. cyclomatic complexity: 960 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:12,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:12,412 INFO L93 Difference]: Finished difference Result 3650 states and 5314 transitions.
[2024-11-08 19:15:12,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3650 states and 5314 transitions.
[2024-11-08 19:15:12,446 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648
[2024-11-08 19:15:12,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3650 states to 3650 states and 5314 transitions.
[2024-11-08 19:15:12,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3650
[2024-11-08 19:15:12,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3650
[2024-11-08 19:15:12,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3650 states and 5314 transitions.
[2024-11-08 19:15:12,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:12,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions.
[2024-11-08 19:15:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states and 5314 transitions.
[2024-11-08 19:15:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 3650.
[2024-11-08 19:15:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3650 states have (on average 1.4558904109589041) internal successors, (5314), 3649 states have internal predecessors, (5314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5314 transitions.
[2024-11-08 19:15:12,566 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3650 states and 5314 transitions.
[2024-11-08 19:15:12,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:12,568 INFO L425 stractBuchiCegarLoop]: Abstraction has 3650 states and 5314 transitions.
[2024-11-08 19:15:12,569 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-08 19:15:12,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3650 states and 5314 transitions.
[2024-11-08 19:15:12,593 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 3648
[2024-11-08 19:15:12,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:12,593 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:12,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:12,596 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]
[2024-11-08 19:15:12,596 INFO L745 eck$LassoCheckResult]: Stem: 11234#$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(16, 2);call #Ultimate.allocInit(12, 3); 11198#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 11199#L155-1
[2024-11-08 19:15:12,597 INFO L747 eck$LassoCheckResult]: Loop: 11199#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 11423#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 11420#L68 assume !(0 != main_~p1~0#1); 11416#L68-2 assume !(0 != main_~p2~0#1); 11413#L72-1 assume !(0 != main_~p3~0#1); 11411#L76-1 assume !(0 != main_~p4~0#1); 11401#L80-1 assume !(0 != main_~p5~0#1); 11403#L84-1 assume !(0 != main_~p6~0#1); 11386#L88-1 assume !(0 != main_~p7~0#1); 11388#L92-1 assume !(0 != main_~p8~0#1); 11370#L96-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 11371#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 11349#L104-1 assume !(0 != main_~p1~0#1); 11350#L110-1 assume !(0 != main_~p2~0#1); 11325#L115-1 assume !(0 != main_~p3~0#1); 11324#L120-1 assume !(0 != main_~p4~0#1); 11441#L125-1 assume !(0 != main_~p5~0#1); 11439#L130-1 assume !(0 != main_~p6~0#1); 11437#L135-1 assume !(0 != main_~p7~0#1); 11435#L140-1 assume !(0 != main_~p8~0#1); 11432#L145-1 assume !(0 != main_~p9~0#1); 11428#L150-1 assume !(0 != main_~p10~0#1); 11199#L155-1
[2024-11-08 19:15:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times
[2024-11-08 19:15:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061860700]
[2024-11-08 19:15:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:12,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:12,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:12,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1854340549, now seen corresponding path program 1 times
[2024-11-08 19:15:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319712766]
[2024-11-08 19:15:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:12,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:12,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:12,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:12,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319712766]
[2024-11-08 19:15:12,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319712766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:12,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 19:15:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915973711]
[2024-11-08 19:15:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:12,664 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:12,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:12,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:12,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:12,665 INFO L87 Difference]: Start difference. First operand 3650 states and 5314 transitions. cyclomatic complexity: 1792 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:12,786 INFO L93 Difference]: Finished difference Result 7170 states and 10242 transitions.
[2024-11-08 19:15:12,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7170 states and 10242 transitions.
[2024-11-08 19:15:12,863 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168
[2024-11-08 19:15:12,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7170 states to 7170 states and 10242 transitions.
[2024-11-08 19:15:12,902 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7170
[2024-11-08 19:15:12,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7170
[2024-11-08 19:15:12,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7170 states and 10242 transitions.
[2024-11-08 19:15:12,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:12,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions.
[2024-11-08 19:15:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states and 10242 transitions.
[2024-11-08 19:15:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7170.
[2024-11-08 19:15:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7170 states have (on average 1.4284518828451882) internal successors, (10242), 7169 states have internal predecessors, (10242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 10242 transitions.
[2024-11-08 19:15:13,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7170 states and 10242 transitions.
[2024-11-08 19:15:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:13,080 INFO L425 stractBuchiCegarLoop]: Abstraction has 7170 states and 10242 transitions.
[2024-11-08 19:15:13,081 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-08 19:15:13,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7170 states and 10242 transitions.
[2024-11-08 19:15:13,113 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7168
[2024-11-08 19:15:13,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:13,114 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:13,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:13,114 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]
[2024-11-08 19:15:13,115 INFO L745 eck$LassoCheckResult]: Stem: 22059#$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(16, 2);call #Ultimate.allocInit(12, 3); 22024#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 22025#L155-1
[2024-11-08 19:15:13,115 INFO L747 eck$LassoCheckResult]: Loop: 22025#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 22198#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 22194#L68 assume !(0 != main_~p1~0#1); 22190#L68-2 assume !(0 != main_~p2~0#1); 22187#L72-1 assume !(0 != main_~p3~0#1); 22183#L76-1 assume !(0 != main_~p4~0#1); 22117#L80-1 assume !(0 != main_~p5~0#1); 22118#L84-1 assume !(0 != main_~p6~0#1); 22317#L88-1 assume !(0 != main_~p7~0#1); 22333#L92-1 assume !(0 != main_~p8~0#1); 22325#L96-1 assume !(0 != main_~p9~0#1); 22290#L100-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 22287#L104-1 assume !(0 != main_~p1~0#1); 22285#L110-1 assume !(0 != main_~p2~0#1); 22282#L115-1 assume !(0 != main_~p3~0#1); 22279#L120-1 assume !(0 != main_~p4~0#1); 22258#L125-1 assume !(0 != main_~p5~0#1); 22259#L130-1 assume !(0 != main_~p6~0#1); 22273#L135-1 assume !(0 != main_~p7~0#1); 22233#L140-1 assume !(0 != main_~p8~0#1); 22231#L145-1 assume !(0 != main_~p9~0#1); 22203#L150-1 assume !(0 != main_~p10~0#1); 22025#L155-1
[2024-11-08 19:15:13,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:13,117 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times
[2024-11-08 19:15:13,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:13,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958186772]
[2024-11-08 19:15:13,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:13,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:13,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1596175111, now seen corresponding path program 1 times
[2024-11-08 19:15:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503992354]
[2024-11-08 19:15:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 19:15:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 19:15:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 19:15:13,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503992354]
[2024-11-08 19:15:13,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503992354] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 19:15:13,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 19:15:13,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 19:15:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127781440]
[2024-11-08 19:15:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 19:15:13,161 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 19:15:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 19:15:13,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 19:15:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 19:15:13,162 INFO L87 Difference]: Start difference. First operand 7170 states and 10242 transitions. cyclomatic complexity: 3328 Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 19:15:13,276 INFO L93 Difference]: Finished difference Result 14082 states and 19714 transitions.
[2024-11-08 19:15:13,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14082 states and 19714 transitions.
[2024-11-08 19:15:13,349 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080
[2024-11-08 19:15:13,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14082 states to 14082 states and 19714 transitions.
[2024-11-08 19:15:13,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14082
[2024-11-08 19:15:13,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14082
[2024-11-08 19:15:13,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14082 states and 19714 transitions.
[2024-11-08 19:15:13,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 19:15:13,449 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions.
[2024-11-08 19:15:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states and 19714 transitions.
[2024-11-08 19:15:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 14082.
[2024-11-08 19:15:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14082 states have (on average 1.3999431898878) internal successors, (19714), 14081 states have internal predecessors, (19714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 19:15:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 19714 transitions.
[2024-11-08 19:15:13,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14082 states and 19714 transitions.
[2024-11-08 19:15:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 19:15:13,830 INFO L425 stractBuchiCegarLoop]: Abstraction has 14082 states and 19714 transitions.
[2024-11-08 19:15:13,831 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-08 19:15:13,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14082 states and 19714 transitions.
[2024-11-08 19:15:13,881 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 14080
[2024-11-08 19:15:13,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 19:15:13,881 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 19:15:13,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 19:15:13,883 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]
[2024-11-08 19:15:13,883 INFO L745 eck$LassoCheckResult]: Stem: 43322#$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(16, 2);call #Ultimate.allocInit(12, 3); 43283#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_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_~cond~0#1; 43284#L155-1
[2024-11-08 19:15:13,884 INFO L747 eck$LassoCheckResult]: Loop: 43284#L155-1 assume !false;havoc main_#t~nondet14#1;main_~cond~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 43413#L43 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0; 43411#L68 assume !(0 != main_~p1~0#1); 43407#L68-2 assume !(0 != main_~p2~0#1); 43405#L72-1 assume !(0 != main_~p3~0#1); 43401#L76-1 assume !(0 != main_~p4~0#1); 43397#L80-1 assume !(0 != main_~p5~0#1); 43393#L84-1 assume !(0 != main_~p6~0#1); 43389#L88-1 assume !(0 != main_~p7~0#1); 43385#L92-1 assume !(0 != main_~p8~0#1); 43381#L96-1 assume !(0 != main_~p9~0#1); 43377#L100-1 assume !(0 != main_~p10~0#1); 43374#L104-1 assume !(0 != main_~p1~0#1); 43375#L110-1 assume !(0 != main_~p2~0#1); 43445#L115-1 assume !(0 != main_~p3~0#1); 43440#L120-1 assume !(0 != main_~p4~0#1); 43436#L125-1 assume !(0 != main_~p5~0#1); 43432#L130-1 assume !(0 != main_~p6~0#1); 43428#L135-1 assume !(0 != main_~p7~0#1); 43424#L140-1 assume !(0 != main_~p8~0#1); 43420#L145-1 assume !(0 != main_~p9~0#1); 43416#L150-1 assume !(0 != main_~p10~0#1); 43284#L155-1
[2024-11-08 19:15:13,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times
[2024-11-08 19:15:13,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:13,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244001085]
[2024-11-08 19:15:13,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:13,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,893 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:13,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:13,902 INFO L85 PathProgramCache]: Analyzing trace with hash -895110533, now seen corresponding path program 1 times
[2024-11-08 19:15:13,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190436282]
[2024-11-08 19:15:13,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:13,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 19:15:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1727555395, now seen corresponding path program 1 times
[2024-11-08 19:15:13,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 19:15:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842662909]
[2024-11-08 19:15:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 19:15:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 19:15:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:13,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 19:15:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:14,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 19:15:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 19:15:14,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.11 07:15:14 BoogieIcfgContainer
[2024-11-08 19:15:14,622 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-11-08 19:15:14,623 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 19:15:14,623 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 19:15:14,623 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 19:15:14,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:10" (3/4) ...
[2024-11-08 19:15:14,626 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample
[2024-11-08 19:15:14,694 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 19:15:14,694 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 19:15:14,695 INFO L158 Benchmark]: Toolchain (without parser) took 4964.11ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 66.4MB in the beginning and 103.1MB in the end (delta: -36.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,698 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 19:15:14,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.96ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 66.1MB in the beginning and 152.0MB in the end (delta: -85.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.17ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 149.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,700 INFO L158 Benchmark]: Boogie Preprocessor took 41.62ms. Allocated memory is still 188.7MB. Free memory was 149.9MB in the beginning and 148.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,700 INFO L158 Benchmark]: RCFGBuilder took 474.68ms. Allocated memory is still 188.7MB. Free memory was 148.7MB in the beginning and 149.5MB in the end (delta: -795.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,701 INFO L158 Benchmark]: BuchiAutomizer took 3995.99ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 148.5MB in the beginning and 105.2MB in the end (delta: 43.3MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,701 INFO L158 Benchmark]: Witness Printer took 71.30ms. Allocated memory is still 226.5MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 19:15:14,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 339.96ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 66.1MB in the beginning and 152.0MB in the end (delta: -85.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 35.17ms. Allocated memory is still 188.7MB. Free memory was 152.0MB in the beginning and 149.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 41.62ms. Allocated memory is still 188.7MB. Free memory was 149.9MB in the beginning and 148.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 474.68ms. Allocated memory is still 188.7MB. Free memory was 148.7MB in the beginning and 149.5MB in the end (delta: -795.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* BuchiAutomizer took 3995.99ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 148.5MB in the beginning and 105.2MB in the end (delta: 43.3MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB.
* Witness Printer took 71.30ms. Allocated memory is still 226.5MB. Free memory was 105.2MB in the beginning and 103.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Constructed decomposition of program
Your program was decomposed into 9 terminating modules (9 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.9 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 14082 locations.
- StatisticsResult: Timing statistics
BüchiAutomizer plugin needed 3.9s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 0.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 1165 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 721 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI9 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s
- TerminationAnalysisResult: Nontermination possible
Buchi Automizer proved that your program is nonterminating for some inputs
- LassoShapedNonTerminationArgument [Line: 41]: Nontermination argument in form of an infinite program execution.
Nontermination argument in form of an infinite program execution.
Stem:
[L8] int p1 = __VERIFIER_nondet_int();
[L9] int lk1;
[L11] int p2 = __VERIFIER_nondet_int();
[L12] int lk2;
[L14] int p3 = __VERIFIER_nondet_int();
[L15] int lk3;
[L17] int p4 = __VERIFIER_nondet_int();
[L18] int lk4;
[L20] int p5 = __VERIFIER_nondet_int();
[L21] int lk5;
[L23] int p6 = __VERIFIER_nondet_int();
[L24] int lk6;
[L26] int p7 = __VERIFIER_nondet_int();
[L27] int lk7;
[L29] int p8 = __VERIFIER_nondet_int();
[L30] int lk8;
[L32] int p9 = __VERIFIER_nondet_int();
[L33] int lk9;
[L35] int p10 = __VERIFIER_nondet_int();
[L36] int lk10;
[L39] int cond;
Loop:
[L41] COND TRUE 1
[L42] cond = __VERIFIER_nondet_int()
[L43] COND FALSE !(cond == 0)
[L46] lk1 = 0
[L48] lk2 = 0
[L50] lk3 = 0
[L52] lk4 = 0
[L54] lk5 = 0
[L56] lk6 = 0
[L58] lk7 = 0
[L60] lk8 = 0
[L62] lk9 = 0
[L64] lk10 = 0
[L68] COND FALSE !(p1 != 0)
[L72] COND FALSE !(p2 != 0)
[L76] COND FALSE !(p3 != 0)
[L80] COND FALSE !(p4 != 0)
[L84] COND FALSE !(p5 != 0)
[L88] COND FALSE !(p6 != 0)
[L92] COND FALSE !(p7 != 0)
[L96] COND FALSE !(p8 != 0)
[L100] COND FALSE !(p9 != 0)
[L104] COND FALSE !(p10 != 0)
[L110] COND FALSE !(p1 != 0)
[L115] COND FALSE !(p2 != 0)
[L120] COND FALSE !(p3 != 0)
[L125] COND FALSE !(p4 != 0)
[L130] COND FALSE !(p5 != 0)
[L135] COND FALSE !(p6 != 0)
[L140] COND FALSE !(p7 != 0)
[L145] COND FALSE !(p8 != 0)
[L150] COND FALSE !(p9 != 0)
[L155] COND FALSE !(p10 != 0)
End of lasso representation.
- StatisticsResult: NonterminationArgumentStatistics
Fixpoint
- NonterminatingLassoResult [Line: 41]: Nonterminating execution
Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L8] int p1 = __VERIFIER_nondet_int();
[L9] int lk1;
[L11] int p2 = __VERIFIER_nondet_int();
[L12] int lk2;
[L14] int p3 = __VERIFIER_nondet_int();
[L15] int lk3;
[L17] int p4 = __VERIFIER_nondet_int();
[L18] int lk4;
[L20] int p5 = __VERIFIER_nondet_int();
[L21] int lk5;
[L23] int p6 = __VERIFIER_nondet_int();
[L24] int lk6;
[L26] int p7 = __VERIFIER_nondet_int();
[L27] int lk7;
[L29] int p8 = __VERIFIER_nondet_int();
[L30] int lk8;
[L32] int p9 = __VERIFIER_nondet_int();
[L33] int lk9;
[L35] int p10 = __VERIFIER_nondet_int();
[L36] int lk10;
[L39] int cond;
Loop:
[L41] COND TRUE 1
[L42] cond = __VERIFIER_nondet_int()
[L43] COND FALSE !(cond == 0)
[L46] lk1 = 0
[L48] lk2 = 0
[L50] lk3 = 0
[L52] lk4 = 0
[L54] lk5 = 0
[L56] lk6 = 0
[L58] lk7 = 0
[L60] lk8 = 0
[L62] lk9 = 0
[L64] lk10 = 0
[L68] COND FALSE !(p1 != 0)
[L72] COND FALSE !(p2 != 0)
[L76] COND FALSE !(p3 != 0)
[L80] COND FALSE !(p4 != 0)
[L84] COND FALSE !(p5 != 0)
[L88] COND FALSE !(p6 != 0)
[L92] COND FALSE !(p7 != 0)
[L96] COND FALSE !(p8 != 0)
[L100] COND FALSE !(p9 != 0)
[L104] COND FALSE !(p10 != 0)
[L110] COND FALSE !(p1 != 0)
[L115] COND FALSE !(p2 != 0)
[L120] COND FALSE !(p3 != 0)
[L125] COND FALSE !(p4 != 0)
[L130] COND FALSE !(p5 != 0)
[L135] COND FALSE !(p6 != 0)
[L140] COND FALSE !(p7 != 0)
[L145] COND FALSE !(p8 != 0)
[L150] COND FALSE !(p9 != 0)
[L155] COND FALSE !(p10 != 0)
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2024-11-08 19:15:14,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_98e45ec0-2683-4116-a412-3b13f95132ef/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(TERM)