./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff 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_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu --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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:00:28,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:00:28,891 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 08:00:28,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:00:28,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:00:28,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:00:28,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:00:28,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:00:28,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:00:28,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:00:28,953 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:00:28,954 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 08:00:28,954 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 08:00:28,956 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 08:00:28,956 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 08:00:28,957 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 08:00:28,957 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 08:00:28,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:00:28,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 08:00:28,976 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:00:28,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:00:28,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:00:28,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:00:28,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 08:00:28,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 08:00:28,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 08:00:28,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:00:28,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:00:28,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:00:28,982 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 08:00:28,983 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:00:28,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:00:28,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:00:28,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:00:28,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:00:28,985 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 08:00:28,986 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_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/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_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2023-11-19 08:00:29,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:00:29,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:00:29,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:00:29,398 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:00:29,401 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:00:29,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/locks/test_locks_11.c [2023-11-19 08:00:32,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:00:32,851 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:00:32,852 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/sv-benchmarks/c/locks/test_locks_11.c [2023-11-19 08:00:32,882 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/data/e955dc389/24381832c2dd4045b42c59394d9d6da6/FLAGd0b9293fa [2023-11-19 08:00:32,897 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/data/e955dc389/24381832c2dd4045b42c59394d9d6da6 [2023-11-19 08:00:32,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:00:32,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:00:32,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:32,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:00:32,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:00:32,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:32" (1/1) ... [2023-11-19 08:00:32,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acdd0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:32, skipping insertion in model container [2023-11-19 08:00:32,912 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:32" (1/1) ... [2023-11-19 08:00:32,954 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:00:33,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:33,135 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:00:33,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:33,174 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:00:33,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33 WrapperNode [2023-11-19 08:00:33,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:33,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:33,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:00:33,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:00:33,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,210 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2023-11-19 08:00:33,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:33,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:00:33,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:00:33,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:00:33,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:00:33,239 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:00:33,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:00:33,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:00:33,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (1/1) ... [2023-11-19 08:00:33,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 08:00:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:33,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 08:00:33,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 08:00:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:00:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:00:33,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:00:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:00:33,536 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:00:33,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:00:33,878 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:00:33,891 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:00:33,892 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 08:00:33,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:33 BoogieIcfgContainer [2023-11-19 08:00:33,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:00:33,897 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 08:00:33,899 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 08:00:33,903 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 08:00:33,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:00:33,904 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 08:00:32" (1/3) ... [2023-11-19 08:00:33,905 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22797137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:00:33, skipping insertion in model container [2023-11-19 08:00:33,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:00:33,905 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:33" (2/3) ... [2023-11-19 08:00:33,905 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22797137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 08:00:33, skipping insertion in model container [2023-11-19 08:00:33,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 08:00:33,906 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:33" (3/3) ... [2023-11-19 08:00:33,907 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2023-11-19 08:00:33,970 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 08:00:33,970 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 08:00:33,970 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 08:00:33,970 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 08:00:33,971 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 08:00:33,971 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 08:00:33,971 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 08:00:33,971 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 08:00:33,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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) [2023-11-19 08:00:33,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-11-19 08:00:33,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:33,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:34,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:34,005 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:34,006 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 08:00:34,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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) [2023-11-19 08:00:34,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2023-11-19 08:00:34,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:34,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:34,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:34,012 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:34,020 INFO L748 eck$LassoCheckResult]: Stem: 39#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 26#L169-1true [2023-11-19 08:00:34,021 INFO L750 eck$LassoCheckResult]: Loop: 26#L169-1true assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 14#L46true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 41#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 42#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 27#L77-1true assume !(0 != main_~p3~0#1); 5#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 23#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 19#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 28#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 36#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24#L109-1true assume !(0 != main_~p11~0#1); 21#L113-1true assume !(0 != main_~p1~0#1); 37#L119-1true assume !(0 != main_~p2~0#1); 8#L124-1true assume !(0 != main_~p3~0#1); 11#L129-1true assume !(0 != main_~p4~0#1); 20#L134-1true assume !(0 != main_~p5~0#1); 10#L139-1true assume !(0 != main_~p6~0#1); 3#L144-1true assume !(0 != main_~p7~0#1); 34#L149-1true assume !(0 != main_~p8~0#1); 18#L154-1true assume !(0 != main_~p9~0#1); 7#L159-1true assume !(0 != main_~p10~0#1); 38#L164-1true assume !(0 != main_~p11~0#1); 26#L169-1true [2023-11-19 08:00:34,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-19 08:00:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089155619] [2023-11-19 08:00:34,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:34,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2023-11-19 08:00:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858669126] [2023-11-19 08:00:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858669126] [2023-11-19 08:00:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858669126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:34,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584936068] [2023-11-19 08:00:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:34,372 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:34,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:34,419 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:34,466 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2023-11-19 08:00:34,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 141 transitions. [2023-11-19 08:00:34,472 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2023-11-19 08:00:34,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 71 states and 113 transitions. [2023-11-19 08:00:34,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2023-11-19 08:00:34,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2023-11-19 08:00:34,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2023-11-19 08:00:34,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:34,481 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2023-11-19 08:00:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2023-11-19 08:00:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-19 08:00:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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) [2023-11-19 08:00:34,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2023-11-19 08:00:34,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 71 states and 113 transitions. [2023-11-19 08:00:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:34,534 INFO L428 stractBuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2023-11-19 08:00:34,535 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 08:00:34,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2023-11-19 08:00:34,540 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2023-11-19 08:00:34,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:34,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:34,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:34,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:34,541 INFO L748 eck$LassoCheckResult]: Stem: 168#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 144#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 145#L169-1 [2023-11-19 08:00:34,542 INFO L750 eck$LassoCheckResult]: Loop: 145#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 176#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 175#L73 assume !(0 != main_~p1~0#1); 170#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 164#L77-1 assume !(0 != main_~p3~0#1); 134#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 135#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 157#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 148#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 149#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 160#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 174#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 173#L109-1 assume !(0 != main_~p11~0#1); 171#L113-1 assume !(0 != main_~p1~0#1); 172#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 193#L129-1 assume !(0 != main_~p4~0#1); 190#L134-1 assume !(0 != main_~p5~0#1); 188#L139-1 assume !(0 != main_~p6~0#1); 186#L144-1 assume !(0 != main_~p7~0#1); 184#L149-1 assume !(0 != main_~p8~0#1); 182#L154-1 assume !(0 != main_~p9~0#1); 180#L159-1 assume !(0 != main_~p10~0#1); 178#L164-1 assume !(0 != main_~p11~0#1); 145#L169-1 [2023-11-19 08:00:34,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-19 08:00:34,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303717721] [2023-11-19 08:00:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:34,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2023-11-19 08:00:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514229485] [2023-11-19 08:00:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:34,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:34,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514229485] [2023-11-19 08:00:34,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514229485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:34,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:34,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:34,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983110671] [2023-11-19 08:00:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:34,646 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:34,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:34,648 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:34,691 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2023-11-19 08:00:34,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2023-11-19 08:00:34,698 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2023-11-19 08:00:34,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2023-11-19 08:00:34,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2023-11-19 08:00:34,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2023-11-19 08:00:34,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2023-11-19 08:00:34,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:34,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2023-11-19 08:00:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2023-11-19 08:00:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-11-19 08:00:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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) [2023-11-19 08:00:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2023-11-19 08:00:34,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 138 states and 218 transitions. [2023-11-19 08:00:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:34,733 INFO L428 stractBuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2023-11-19 08:00:34,733 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 08:00:34,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2023-11-19 08:00:34,736 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2023-11-19 08:00:34,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:34,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:34,745 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:34,745 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:34,746 INFO L748 eck$LassoCheckResult]: Stem: 387#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 360#L169-1 [2023-11-19 08:00:34,747 INFO L750 eck$LassoCheckResult]: Loop: 360#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 402#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 403#L73 assume !(0 != main_~p1~0#1); 404#L73-2 assume !(0 != main_~p2~0#1); 481#L77-1 assume !(0 != main_~p3~0#1); 479#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 477#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 475#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 473#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 471#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 469#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 468#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 467#L109-1 assume !(0 != main_~p11~0#1); 465#L113-1 assume !(0 != main_~p1~0#1); 466#L119-1 assume !(0 != main_~p2~0#1); 356#L124-1 assume !(0 != main_~p3~0#1); 357#L129-1 assume !(0 != main_~p4~0#1); 352#L134-1 assume !(0 != main_~p5~0#1); 361#L139-1 assume !(0 != main_~p6~0#1); 346#L144-1 assume !(0 != main_~p7~0#1); 348#L149-1 assume !(0 != main_~p8~0#1); 370#L154-1 assume !(0 != main_~p9~0#1); 371#L159-1 assume !(0 != main_~p10~0#1); 411#L164-1 assume !(0 != main_~p11~0#1); 360#L169-1 [2023-11-19 08:00:34,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-19 08:00:34,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662464311] [2023-11-19 08:00:34,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:34,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2023-11-19 08:00:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779388191] [2023-11-19 08:00:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:34,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:34,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779388191] [2023-11-19 08:00:34,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779388191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:34,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:34,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:34,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952223766] [2023-11-19 08:00:34,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:34,866 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:34,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:34,867 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:34,887 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2023-11-19 08:00:34,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2023-11-19 08:00:34,891 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2023-11-19 08:00:34,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2023-11-19 08:00:34,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2023-11-19 08:00:34,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2023-11-19 08:00:34,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2023-11-19 08:00:34,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:34,899 INFO L218 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2023-11-19 08:00:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2023-11-19 08:00:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2023-11-19 08:00:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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) [2023-11-19 08:00:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2023-11-19 08:00:34,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 422 transitions. [2023-11-19 08:00:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:34,936 INFO L428 stractBuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2023-11-19 08:00:34,936 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 08:00:34,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2023-11-19 08:00:34,939 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2023-11-19 08:00:34,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:34,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:34,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:34,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:34,944 INFO L748 eck$LassoCheckResult]: Stem: 805#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 773#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 774#L169-1 [2023-11-19 08:00:34,944 INFO L750 eck$LassoCheckResult]: Loop: 774#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 859#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 853#L73 assume !(0 != main_~p1~0#1); 847#L73-2 assume !(0 != main_~p2~0#1); 848#L77-1 assume !(0 != main_~p3~0#1); 928#L81-1 assume !(0 != main_~p4~0#1); 926#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 923#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 834#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 835#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 830#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 803#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 794#L109-1 assume !(0 != main_~p11~0#1); 795#L113-1 assume !(0 != main_~p1~0#1); 905#L119-1 assume !(0 != main_~p2~0#1); 906#L124-1 assume !(0 != main_~p3~0#1); 947#L129-1 assume !(0 != main_~p4~0#1); 946#L134-1 assume !(0 != main_~p5~0#1); 944#L139-1 assume !(0 != main_~p6~0#1); 942#L144-1 assume !(0 != main_~p7~0#1); 940#L149-1 assume !(0 != main_~p8~0#1); 938#L154-1 assume !(0 != main_~p9~0#1); 936#L159-1 assume !(0 != main_~p10~0#1); 867#L164-1 assume !(0 != main_~p11~0#1); 774#L169-1 [2023-11-19 08:00:34,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-19 08:00:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151614481] [2023-11-19 08:00:34,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:34,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:34,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2023-11-19 08:00:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:34,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062305893] [2023-11-19 08:00:34,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:34,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:35,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:35,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062305893] [2023-11-19 08:00:35,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062305893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:35,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:35,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506415478] [2023-11-19 08:00:35,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:35,019 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:35,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:35,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:35,020 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:35,043 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2023-11-19 08:00:35,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2023-11-19 08:00:35,050 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2023-11-19 08:00:35,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2023-11-19 08:00:35,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2023-11-19 08:00:35,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2023-11-19 08:00:35,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2023-11-19 08:00:35,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:35,066 INFO L218 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2023-11-19 08:00:35,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2023-11-19 08:00:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2023-11-19 08:00:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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) [2023-11-19 08:00:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2023-11-19 08:00:35,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 818 transitions. [2023-11-19 08:00:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:35,095 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2023-11-19 08:00:35,095 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 08:00:35,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2023-11-19 08:00:35,100 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2023-11-19 08:00:35,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:35,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:35,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:35,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:35,101 INFO L748 eck$LassoCheckResult]: Stem: 1611#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 1580#L169-1 [2023-11-19 08:00:35,102 INFO L750 eck$LassoCheckResult]: Loop: 1580#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1703#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 1696#L73 assume !(0 != main_~p1~0#1); 1688#L73-2 assume !(0 != main_~p2~0#1); 1690#L77-1 assume !(0 != main_~p3~0#1); 1668#L81-1 assume !(0 != main_~p4~0#1); 1670#L85-1 assume !(0 != main_~p5~0#1); 1811#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1857#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1856#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1855#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1854#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1853#L109-1 assume !(0 != main_~p11~0#1); 1852#L113-1 assume !(0 != main_~p1~0#1); 1851#L119-1 assume !(0 != main_~p2~0#1); 1850#L124-1 assume !(0 != main_~p3~0#1); 1844#L129-1 assume !(0 != main_~p4~0#1); 1839#L134-1 assume !(0 != main_~p5~0#1); 1840#L139-1 assume !(0 != main_~p6~0#1); 1847#L144-1 assume !(0 != main_~p7~0#1); 1832#L149-1 assume !(0 != main_~p8~0#1); 1774#L154-1 assume !(0 != main_~p9~0#1); 1773#L159-1 assume !(0 != main_~p10~0#1); 1715#L164-1 assume !(0 != main_~p11~0#1); 1580#L169-1 [2023-11-19 08:00:35,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-19 08:00:35,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220562134] [2023-11-19 08:00:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:35,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:35,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:35,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2023-11-19 08:00:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384897642] [2023-11-19 08:00:35,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:35,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:35,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384897642] [2023-11-19 08:00:35,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384897642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918501094] [2023-11-19 08:00:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:35,213 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:35,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:35,214 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:35,256 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2023-11-19 08:00:35,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2023-11-19 08:00:35,269 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2023-11-19 08:00:35,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2023-11-19 08:00:35,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2023-11-19 08:00:35,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2023-11-19 08:00:35,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2023-11-19 08:00:35,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:35,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2023-11-19 08:00:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2023-11-19 08:00:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2023-11-19 08:00:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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) [2023-11-19 08:00:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2023-11-19 08:00:35,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2023-11-19 08:00:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:35,334 INFO L428 stractBuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2023-11-19 08:00:35,335 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 08:00:35,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2023-11-19 08:00:35,343 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2023-11-19 08:00:35,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:35,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:35,345 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:35,345 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:35,346 INFO L748 eck$LassoCheckResult]: Stem: 3187#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3157#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 3158#L169-1 [2023-11-19 08:00:35,346 INFO L750 eck$LassoCheckResult]: Loop: 3158#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3278#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 3274#L73 assume !(0 != main_~p1~0#1); 3270#L73-2 assume !(0 != main_~p2~0#1); 3268#L77-1 assume !(0 != main_~p3~0#1); 3239#L81-1 assume !(0 != main_~p4~0#1); 3237#L85-1 assume !(0 != main_~p5~0#1); 3238#L89-1 assume !(0 != main_~p6~0#1); 3375#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3371#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3368#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3363#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3362#L109-1 assume !(0 != main_~p11~0#1); 3329#L113-1 assume !(0 != main_~p1~0#1); 3325#L119-1 assume !(0 != main_~p2~0#1); 3324#L124-1 assume !(0 != main_~p3~0#1); 3321#L129-1 assume !(0 != main_~p4~0#1); 3319#L134-1 assume !(0 != main_~p5~0#1); 3317#L139-1 assume !(0 != main_~p6~0#1); 3316#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3312#L154-1 assume !(0 != main_~p9~0#1); 3310#L159-1 assume !(0 != main_~p10~0#1); 3282#L164-1 assume !(0 != main_~p11~0#1); 3158#L169-1 [2023-11-19 08:00:35,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-19 08:00:35,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817027665] [2023-11-19 08:00:35,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:35,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:35,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:35,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2023-11-19 08:00:35,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161390379] [2023-11-19 08:00:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161390379] [2023-11-19 08:00:35,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161390379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:35,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:35,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:35,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486442662] [2023-11-19 08:00:35,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:35,453 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:35,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:35,454 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:35,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:35,493 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2023-11-19 08:00:35,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2023-11-19 08:00:35,531 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2023-11-19 08:00:35,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2023-11-19 08:00:35,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2023-11-19 08:00:35,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2023-11-19 08:00:35,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2023-11-19 08:00:35,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:35,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2023-11-19 08:00:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2023-11-19 08:00:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2023-11-19 08:00:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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) [2023-11-19 08:00:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2023-11-19 08:00:35,615 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2023-11-19 08:00:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:35,618 INFO L428 stractBuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2023-11-19 08:00:35,619 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 08:00:35,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2023-11-19 08:00:35,636 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2023-11-19 08:00:35,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:35,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:35,639 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:35,639 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:35,639 INFO L748 eck$LassoCheckResult]: Stem: 6284#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 6255#L169-1 [2023-11-19 08:00:35,640 INFO L750 eck$LassoCheckResult]: Loop: 6255#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6353#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 6351#L73 assume !(0 != main_~p1~0#1); 6347#L73-2 assume !(0 != main_~p2~0#1); 6345#L77-1 assume !(0 != main_~p3~0#1); 6341#L81-1 assume !(0 != main_~p4~0#1); 6337#L85-1 assume !(0 != main_~p5~0#1); 6333#L89-1 assume !(0 != main_~p6~0#1); 6329#L93-1 assume !(0 != main_~p7~0#1); 6327#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6325#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6323#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6321#L109-1 assume !(0 != main_~p11~0#1); 6318#L113-1 assume !(0 != main_~p1~0#1); 6319#L119-1 assume !(0 != main_~p2~0#1); 6389#L124-1 assume !(0 != main_~p3~0#1); 6384#L129-1 assume !(0 != main_~p4~0#1); 6380#L134-1 assume !(0 != main_~p5~0#1); 6376#L139-1 assume !(0 != main_~p6~0#1); 6372#L144-1 assume !(0 != main_~p7~0#1); 6369#L149-1 assume !(0 != main_~p8~0#1); 6365#L154-1 assume !(0 != main_~p9~0#1); 6361#L159-1 assume !(0 != main_~p10~0#1); 6357#L164-1 assume !(0 != main_~p11~0#1); 6255#L169-1 [2023-11-19 08:00:35,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,641 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-19 08:00:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050359713] [2023-11-19 08:00:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:35,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:35,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:35,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2023-11-19 08:00:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699804299] [2023-11-19 08:00:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699804299] [2023-11-19 08:00:35,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699804299] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:35,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:35,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:35,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709810675] [2023-11-19 08:00:35,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:35,733 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:35,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:35,734 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:35,781 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2023-11-19 08:00:35,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2023-11-19 08:00:35,829 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2023-11-19 08:00:35,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2023-11-19 08:00:35,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2023-11-19 08:00:35,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2023-11-19 08:00:35,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2023-11-19 08:00:35,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:35,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2023-11-19 08:00:35,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2023-11-19 08:00:36,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2023-11-19 08:00:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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) [2023-11-19 08:00:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2023-11-19 08:00:36,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2023-11-19 08:00:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:36,046 INFO L428 stractBuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2023-11-19 08:00:36,046 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-19 08:00:36,046 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2023-11-19 08:00:36,077 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2023-11-19 08:00:36,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:36,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:36,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:36,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:36,078 INFO L748 eck$LassoCheckResult]: Stem: 12378#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 12344#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 12345#L169-1 [2023-11-19 08:00:36,078 INFO L750 eck$LassoCheckResult]: Loop: 12345#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12485#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 12481#L73 assume !(0 != main_~p1~0#1); 12474#L73-2 assume !(0 != main_~p2~0#1); 12469#L77-1 assume !(0 != main_~p3~0#1); 12462#L81-1 assume !(0 != main_~p4~0#1); 12454#L85-1 assume !(0 != main_~p5~0#1); 12446#L89-1 assume !(0 != main_~p6~0#1); 12438#L93-1 assume !(0 != main_~p7~0#1); 12432#L97-1 assume !(0 != main_~p8~0#1); 12427#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12424#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12420#L109-1 assume !(0 != main_~p11~0#1); 12421#L113-1 assume !(0 != main_~p1~0#1); 12410#L119-1 assume !(0 != main_~p2~0#1); 12412#L124-1 assume !(0 != main_~p3~0#1); 12562#L129-1 assume !(0 != main_~p4~0#1); 12560#L134-1 assume !(0 != main_~p5~0#1); 12550#L139-1 assume !(0 != main_~p6~0#1); 12546#L144-1 assume !(0 != main_~p7~0#1); 12543#L149-1 assume !(0 != main_~p8~0#1); 12539#L154-1 assume !(0 != main_~p9~0#1); 12508#L159-1 assume !(0 != main_~p10~0#1); 12494#L164-1 assume !(0 != main_~p11~0#1); 12345#L169-1 [2023-11-19 08:00:36,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-19 08:00:36,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831074652] [2023-11-19 08:00:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:36,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:36,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:36,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2023-11-19 08:00:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:36,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789621447] [2023-11-19 08:00:36,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:36,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789621447] [2023-11-19 08:00:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789621447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:36,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:36,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:36,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126830333] [2023-11-19 08:00:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:36,154 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:36,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:36,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:36,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:36,155 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:36,225 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2023-11-19 08:00:36,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2023-11-19 08:00:36,292 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2023-11-19 08:00:36,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2023-11-19 08:00:36,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2023-11-19 08:00:36,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2023-11-19 08:00:36,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2023-11-19 08:00:36,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:36,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2023-11-19 08:00:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2023-11-19 08:00:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2023-11-19 08:00:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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) [2023-11-19 08:00:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2023-11-19 08:00:36,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2023-11-19 08:00:36,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:36,666 INFO L428 stractBuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2023-11-19 08:00:36,666 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-19 08:00:36,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2023-11-19 08:00:36,703 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2023-11-19 08:00:36,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:36,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:36,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:36,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:36,705 INFO L748 eck$LassoCheckResult]: Stem: 24362#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 24322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 24323#L169-1 [2023-11-19 08:00:36,705 INFO L750 eck$LassoCheckResult]: Loop: 24323#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24513#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 24498#L73 assume !(0 != main_~p1~0#1); 24500#L73-2 assume !(0 != main_~p2~0#1); 24477#L77-1 assume !(0 != main_~p3~0#1); 24478#L81-1 assume !(0 != main_~p4~0#1); 24454#L85-1 assume !(0 != main_~p5~0#1); 24456#L89-1 assume !(0 != main_~p6~0#1); 24430#L93-1 assume !(0 != main_~p7~0#1); 24432#L97-1 assume !(0 != main_~p8~0#1); 24568#L101-1 assume !(0 != main_~p9~0#1); 24567#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24566#L109-1 assume !(0 != main_~p11~0#1); 24564#L113-1 assume !(0 != main_~p1~0#1); 24560#L119-1 assume !(0 != main_~p2~0#1); 24557#L124-1 assume !(0 != main_~p3~0#1); 24552#L129-1 assume !(0 != main_~p4~0#1); 24548#L134-1 assume !(0 != main_~p5~0#1); 24544#L139-1 assume !(0 != main_~p6~0#1); 24540#L144-1 assume !(0 != main_~p7~0#1); 24537#L149-1 assume !(0 != main_~p8~0#1); 24538#L154-1 assume !(0 != main_~p9~0#1); 24529#L159-1 assume !(0 != main_~p10~0#1); 24528#L164-1 assume !(0 != main_~p11~0#1); 24323#L169-1 [2023-11-19 08:00:36,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2023-11-19 08:00:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:36,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784897226] [2023-11-19 08:00:36,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:36,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:36,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:36,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2023-11-19 08:00:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800675792] [2023-11-19 08:00:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:36,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:36,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:36,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800675792] [2023-11-19 08:00:36,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800675792] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:36,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:36,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:00:36,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392876839] [2023-11-19 08:00:36,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:36,760 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 08:00:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:36,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:00:36,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:00:36,761 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-19 08:00:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:36,852 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2023-11-19 08:00:36,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2023-11-19 08:00:37,121 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2023-11-19 08:00:37,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2023-11-19 08:00:37,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2023-11-19 08:00:37,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2023-11-19 08:00:37,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2023-11-19 08:00:37,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:00:37,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2023-11-19 08:00:37,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2023-11-19 08:00:37,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2023-11-19 08:00:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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) [2023-11-19 08:00:37,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2023-11-19 08:00:37,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2023-11-19 08:00:37,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:00:37,996 INFO L428 stractBuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2023-11-19 08:00:38,001 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-11-19 08:00:38,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2023-11-19 08:00:38,085 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2023-11-19 08:00:38,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 08:00:38,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 08:00:38,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 08:00:38,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:38,087 INFO L748 eck$LassoCheckResult]: Stem: 47922#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 47883#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_#t~nondet12#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;havoc main_#t~nondet13#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;havoc main_#t~nondet14#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; 47884#L169-1 [2023-11-19 08:00:38,088 INFO L750 eck$LassoCheckResult]: Loop: 47884#L169-1 assume !false;havoc main_#t~nondet15#1;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48302#L46 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; 48299#L73 assume !(0 != main_~p1~0#1); 48295#L73-2 assume !(0 != main_~p2~0#1); 48292#L77-1 assume !(0 != main_~p3~0#1); 48289#L81-1 assume !(0 != main_~p4~0#1); 48285#L85-1 assume !(0 != main_~p5~0#1); 48280#L89-1 assume !(0 != main_~p6~0#1); 48276#L93-1 assume !(0 != main_~p7~0#1); 48272#L97-1 assume !(0 != main_~p8~0#1); 48268#L101-1 assume !(0 != main_~p9~0#1); 48269#L105-1 assume !(0 != main_~p10~0#1); 48277#L109-1 assume !(0 != main_~p11~0#1); 48274#L113-1 assume !(0 != main_~p1~0#1); 48270#L119-1 assume !(0 != main_~p2~0#1); 48266#L124-1 assume !(0 != main_~p3~0#1); 48261#L129-1 assume !(0 != main_~p4~0#1); 48258#L134-1 assume !(0 != main_~p5~0#1); 48224#L139-1 assume !(0 != main_~p6~0#1); 48211#L144-1 assume !(0 != main_~p7~0#1); 48209#L149-1 assume !(0 != main_~p8~0#1); 48205#L154-1 assume !(0 != main_~p9~0#1); 48206#L159-1 assume !(0 != main_~p10~0#1); 48307#L164-1 assume !(0 != main_~p11~0#1); 47884#L169-1 [2023-11-19 08:00:38,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2023-11-19 08:00:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995617450] [2023-11-19 08:00:38,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:38,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:38,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2023-11-19 08:00:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125803044] [2023-11-19 08:00:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:38,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2023-11-19 08:00:38,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:38,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014726418] [2023-11-19 08:00:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:00:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:00:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:00:38,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 08:00:38 BoogieIcfgContainer [2023-11-19 08:00:38,972 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-19 08:00:38,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:00:38,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:00:38,973 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:00:38,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:33" (3/4) ... [2023-11-19 08:00:38,976 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-19 08:00:39,025 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:00:39,025 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:00:39,026 INFO L158 Benchmark]: Toolchain (without parser) took 6123.95ms. Allocated memory was 163.6MB in the beginning and 394.3MB in the end (delta: 230.7MB). Free memory was 135.1MB in the beginning and 241.5MB in the end (delta: -106.4MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,026 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 130.0MB. Free memory was 102.8MB in the beginning and 102.8MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:00:39,027 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.53ms. Allocated memory is still 163.6MB. Free memory was 134.9MB in the beginning and 126.6MB in the end (delta: 8.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,027 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.18ms. Allocated memory is still 163.6MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,028 INFO L158 Benchmark]: Boogie Preprocessor took 27.02ms. Allocated memory is still 163.6MB. Free memory was 125.1MB in the beginning and 123.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,028 INFO L158 Benchmark]: RCFGBuilder took 656.80ms. Allocated memory is still 163.6MB. Free memory was 123.7MB in the beginning and 123.1MB in the end (delta: 637.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,029 INFO L158 Benchmark]: BuchiAutomizer took 5074.99ms. Allocated memory was 163.6MB in the beginning and 394.3MB in the end (delta: 230.7MB). Free memory was 123.1MB in the beginning and 244.6MB in the end (delta: -121.5MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,030 INFO L158 Benchmark]: Witness Printer took 52.26ms. Allocated memory is still 394.3MB. Free memory was 244.6MB in the beginning and 241.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:00:39,032 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.60ms. Allocated memory is still 130.0MB. Free memory was 102.8MB in the beginning and 102.8MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.53ms. Allocated memory is still 163.6MB. Free memory was 134.9MB in the beginning and 126.6MB in the end (delta: 8.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.18ms. Allocated memory is still 163.6MB. Free memory was 126.6MB in the beginning and 125.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.02ms. Allocated memory is still 163.6MB. Free memory was 125.1MB in the beginning and 123.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.80ms. Allocated memory is still 163.6MB. Free memory was 123.7MB in the beginning and 123.1MB in the end (delta: 637.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 5074.99ms. Allocated memory was 163.6MB in the beginning and 394.3MB in the end (delta: 230.7MB). Free memory was 123.1MB in the beginning and 244.6MB in the end (delta: -121.5MB). Peak memory consumption was 110.0MB. Max. memory is 16.1GB. * Witness Printer took 52.26ms. Allocated memory is still 394.3MB. Free memory was 244.6MB in the beginning and 241.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 15618 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 10 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 0. Minimization of det autom 9. Minimization of nondet autom 0. Automata minimization 1.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.7s 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, 409 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 1285 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 795 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: 44]: 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; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 44]: 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; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L42] int cond; Loop: [L44] COND TRUE 1 [L45] cond = __VERIFIER_nondet_int() [L46] COND FALSE !(cond == 0) [L49] lk1 = 0 [L51] lk2 = 0 [L53] lk3 = 0 [L55] lk4 = 0 [L57] lk5 = 0 [L59] lk6 = 0 [L61] lk7 = 0 [L63] lk8 = 0 [L65] lk9 = 0 [L67] lk10 = 0 [L69] lk11 = 0 [L73] COND FALSE !(p1 != 0) [L77] COND FALSE !(p2 != 0) [L81] COND FALSE !(p3 != 0) [L85] COND FALSE !(p4 != 0) [L89] COND FALSE !(p5 != 0) [L93] COND FALSE !(p6 != 0) [L97] COND FALSE !(p7 != 0) [L101] COND FALSE !(p8 != 0) [L105] COND FALSE !(p9 != 0) [L109] COND FALSE !(p10 != 0) [L113] COND FALSE !(p11 != 0) [L119] COND FALSE !(p1 != 0) [L124] COND FALSE !(p2 != 0) [L129] COND FALSE !(p3 != 0) [L134] COND FALSE !(p4 != 0) [L139] COND FALSE !(p5 != 0) [L144] COND FALSE !(p6 != 0) [L149] COND FALSE !(p7 != 0) [L154] COND FALSE !(p8 != 0) [L159] COND FALSE !(p9 != 0) [L164] COND FALSE !(p10 != 0) [L169] COND FALSE !(p11 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-19 08:00:39,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71949207-717d-4d94-8f61-0301eaf472af/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)