./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/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_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_7.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/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_fc55efd9-0409-4398-a2ee-b95458545594/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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:40:27,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:40:27,084 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-19 07:40:27,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:40:27,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:40:27,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:40:27,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:40:27,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:40:27,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:40:27,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:40:27,131 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:40:27,132 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-19 07:40:27,133 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-19 07:40:27,136 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-19 07:40:27,137 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-19 07:40:27,137 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-19 07:40:27,139 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-19 07:40:27,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:40:27,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-19 07:40:27,145 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:40:27,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:40:27,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:40:27,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:40:27,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-19 07:40:27,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-19 07:40:27,148 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-19 07:40:27,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:40:27,149 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:40:27,149 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:40:27,149 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-19 07:40:27,150 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:40:27,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:40:27,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:40:27,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:40:27,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:40:27,152 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-19 07:40:27,152 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_fc55efd9-0409-4398-a2ee-b95458545594/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_fc55efd9-0409-4398-a2ee-b95458545594/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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2023-11-19 07:40:27,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:40:27,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:40:27,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:40:27,506 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:40:27,508 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:40:27,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/locks/test_locks_7.c [2023-11-19 07:40:30,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:40:31,175 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:40:31,183 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/sv-benchmarks/c/locks/test_locks_7.c [2023-11-19 07:40:31,192 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/data/a2f2e5a19/85448e47f188470f8e50494645750872/FLAG23b6a1a0e [2023-11-19 07:40:31,208 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/data/a2f2e5a19/85448e47f188470f8e50494645750872 [2023-11-19 07:40:31,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:40:31,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:40:31,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:31,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:40:31,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:40:31,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@205c01e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31, skipping insertion in model container [2023-11-19 07:40:31,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,248 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:40:31,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:31,475 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:40:31,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:40:31,518 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:40:31,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31 WrapperNode [2023-11-19 07:40:31,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:40:31,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:31,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:40:31,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:40:31,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,567 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2023-11-19 07:40:31,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:40:31,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:40:31,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:40:31,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:40:31,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:40:31,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:40:31,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:40:31,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:40:31,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (1/1) ... [2023-11-19 07:40:31,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-19 07:40:31,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:40:31,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-19 07:40:31,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-19 07:40:31,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:40:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:40:31,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:40:31,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:40:31,764 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:40:31,767 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:40:31,956 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:40:31,965 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:40:31,965 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-19 07:40:31,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:31 BoogieIcfgContainer [2023-11-19 07:40:31,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:40:31,972 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-19 07:40:31,972 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-19 07:40:31,977 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-19 07:40:31,978 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:40:31,979 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:40:31" (1/3) ... [2023-11-19 07:40:31,980 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4826c699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:40:31, skipping insertion in model container [2023-11-19 07:40:31,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:40:31,980 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:31" (2/3) ... [2023-11-19 07:40:31,981 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4826c699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:40:31, skipping insertion in model container [2023-11-19 07:40:31,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-19 07:40:31,981 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:31" (3/3) ... [2023-11-19 07:40:31,983 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_7.c [2023-11-19 07:40:32,052 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-19 07:40:32,052 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-19 07:40:32,052 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-19 07:40:32,053 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-19 07:40:32,053 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-19 07:40:32,053 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-19 07:40:32,053 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-19 07:40:32,054 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-19 07:40:32,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 07:40:32,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-19 07:40:32,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:32,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:32,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:32,092 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:32,092 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-19 07:40:32,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 07:40:32,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2023-11-19 07:40:32,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:32,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:32,097 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:32,097 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:32,106 INFO L748 eck$LassoCheckResult]: Stem: 29#$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(15, 2);call #Ultimate.allocInit(12, 3); 5#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_~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_~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_~cond~0#1; 17#L113-1true [2023-11-19 07:40:32,107 INFO L750 eck$LassoCheckResult]: Loop: 17#L113-1true assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 27#L34true 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; 30#L53true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L53-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L57-1true assume !(0 != main_~p3~0#1); 9#L61-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 24#L65-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 26#L69-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 11#L73-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 23#L77-1true assume !(0 != main_~p1~0#1); 31#L83-1true assume !(0 != main_~p2~0#1); 15#L88-1true assume !(0 != main_~p3~0#1); 10#L93-1true assume !(0 != main_~p4~0#1); 16#L98-1true assume !(0 != main_~p5~0#1); 7#L103-1true assume !(0 != main_~p6~0#1); 14#L108-1true assume !(0 != main_~p7~0#1); 17#L113-1true [2023-11-19 07:40:32,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-19 07:40:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344091451] [2023-11-19 07:40:32,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:32,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2067454588, now seen corresponding path program 1 times [2023-11-19 07:40:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129672401] [2023-11-19 07:40:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:32,432 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 07:40:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129672401] [2023-11-19 07:40:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129672401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:32,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53597900] [2023-11-19 07:40:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:32,442 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:40:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:32,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:32,488 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 07:40:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:32,531 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2023-11-19 07:40:32,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 93 transitions. [2023-11-19 07:40:32,537 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2023-11-19 07:40:32,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 47 states and 73 transitions. [2023-11-19 07:40:32,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-11-19 07:40:32,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2023-11-19 07:40:32,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 73 transitions. [2023-11-19 07:40:32,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:32,547 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2023-11-19 07:40:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 73 transitions. [2023-11-19 07:40:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-19 07:40:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 46 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:40:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2023-11-19 07:40:32,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 73 transitions. [2023-11-19 07:40:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:32,591 INFO L428 stractBuchiCegarLoop]: Abstraction has 47 states and 73 transitions. [2023-11-19 07:40:32,592 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-19 07:40:32,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 73 transitions. [2023-11-19 07:40:32,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2023-11-19 07:40:32,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:32,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:32,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:32,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:32,596 INFO L748 eck$LassoCheckResult]: Stem: 120#$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(15, 2);call #Ultimate.allocInit(12, 3); 99#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_~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_~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_~cond~0#1; 100#L113-1 [2023-11-19 07:40:32,597 INFO L750 eck$LassoCheckResult]: Loop: 100#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 115#L34 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; 119#L53 assume !(0 != main_~p1~0#1); 122#L53-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 141#L57-1 assume !(0 != main_~p3~0#1); 140#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 139#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 138#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 137#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 136#L77-1 assume !(0 != main_~p1~0#1); 135#L83-1 assume !(0 != main_~p2~0#1); 133#L88-1 assume !(0 != main_~p3~0#1); 131#L93-1 assume !(0 != main_~p4~0#1); 128#L98-1 assume !(0 != main_~p5~0#1); 103#L103-1 assume !(0 != main_~p6~0#1); 105#L108-1 assume !(0 != main_~p7~0#1); 100#L113-1 [2023-11-19 07:40:32,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-19 07:40:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909449304] [2023-11-19 07:40:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:32,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1216395458, now seen corresponding path program 1 times [2023-11-19 07:40:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866670224] [2023-11-19 07:40:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:32,670 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 07:40:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:32,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866670224] [2023-11-19 07:40:32,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866670224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:32,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:32,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402270084] [2023-11-19 07:40:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:32,673 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:40:32,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:32,675 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 07:40:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:32,701 INFO L93 Difference]: Finished difference Result 90 states and 138 transitions. [2023-11-19 07:40:32,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 138 transitions. [2023-11-19 07:40:32,706 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2023-11-19 07:40:32,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 138 transitions. [2023-11-19 07:40:32,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2023-11-19 07:40:32,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2023-11-19 07:40:32,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 138 transitions. [2023-11-19 07:40:32,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:32,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-11-19 07:40:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 138 transitions. [2023-11-19 07:40:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-19 07:40:32,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 1.5333333333333334) internal successors, (138), 89 states have internal predecessors, (138), 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 07:40:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2023-11-19 07:40:32,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-11-19 07:40:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:32,727 INFO L428 stractBuchiCegarLoop]: Abstraction has 90 states and 138 transitions. [2023-11-19 07:40:32,727 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-19 07:40:32,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 138 transitions. [2023-11-19 07:40:32,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 88 [2023-11-19 07:40:32,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:32,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:32,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:32,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:32,732 INFO L748 eck$LassoCheckResult]: Stem: 272#$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(15, 2);call #Ultimate.allocInit(12, 3); 242#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_~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_~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_~cond~0#1; 243#L113-1 [2023-11-19 07:40:32,732 INFO L750 eck$LassoCheckResult]: Loop: 243#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 289#L34 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; 290#L53 assume !(0 != main_~p1~0#1); 305#L53-2 assume !(0 != main_~p2~0#1); 254#L57-1 assume !(0 != main_~p3~0#1); 249#L61-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 250#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 268#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 269#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 297#L77-1 assume !(0 != main_~p1~0#1); 274#L83-1 assume !(0 != main_~p2~0#1); 257#L88-1 assume !(0 != main_~p3~0#1); 259#L93-1 assume !(0 != main_~p4~0#1); 260#L98-1 assume !(0 != main_~p5~0#1); 261#L103-1 assume !(0 != main_~p6~0#1); 308#L108-1 assume !(0 != main_~p7~0#1); 243#L113-1 [2023-11-19 07:40:32,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,733 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-19 07:40:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022114653] [2023-11-19 07:40:32,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:32,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash 629589444, now seen corresponding path program 1 times [2023-11-19 07:40:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729716523] [2023-11-19 07:40:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:32,811 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 07:40:32,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729716523] [2023-11-19 07:40:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729716523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:32,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:32,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:32,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305874249] [2023-11-19 07:40:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:32,814 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:40:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:32,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:32,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:32,816 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. cyclomatic complexity: 52 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 07:40:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:32,842 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2023-11-19 07:40:32,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 262 transitions. [2023-11-19 07:40:32,852 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2023-11-19 07:40:32,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 262 transitions. [2023-11-19 07:40:32,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2023-11-19 07:40:32,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2023-11-19 07:40:32,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 262 transitions. [2023-11-19 07:40:32,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:32,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2023-11-19 07:40:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 262 transitions. [2023-11-19 07:40:32,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2023-11-19 07:40:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5057471264367817) internal successors, (262), 173 states have internal predecessors, (262), 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 07:40:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2023-11-19 07:40:32,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 262 transitions. [2023-11-19 07:40:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:32,895 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 262 transitions. [2023-11-19 07:40:32,895 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-19 07:40:32,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 262 transitions. [2023-11-19 07:40:32,898 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 172 [2023-11-19 07:40:32,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:32,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:32,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:32,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:32,900 INFO L748 eck$LassoCheckResult]: Stem: 540#$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(15, 2);call #Ultimate.allocInit(12, 3); 512#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_~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_~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_~cond~0#1; 513#L113-1 [2023-11-19 07:40:32,900 INFO L750 eck$LassoCheckResult]: Loop: 513#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 574#L34 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; 569#L53 assume !(0 != main_~p1~0#1); 570#L53-2 assume !(0 != main_~p2~0#1); 626#L57-1 assume !(0 != main_~p3~0#1); 623#L61-1 assume !(0 != main_~p4~0#1); 619#L65-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 614#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 610#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 606#L77-1 assume !(0 != main_~p1~0#1); 605#L83-1 assume !(0 != main_~p2~0#1); 604#L88-1 assume !(0 != main_~p3~0#1); 601#L93-1 assume !(0 != main_~p4~0#1); 599#L98-1 assume !(0 != main_~p5~0#1); 598#L103-1 assume !(0 != main_~p6~0#1); 596#L108-1 assume !(0 != main_~p7~0#1); 513#L113-1 [2023-11-19 07:40:32,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-19 07:40:32,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709356901] [2023-11-19 07:40:32,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:32,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:32,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654022, now seen corresponding path program 1 times [2023-11-19 07:40:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706373259] [2023-11-19 07:40:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:32,983 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 07:40:32,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:32,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706373259] [2023-11-19 07:40:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706373259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:32,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876987134] [2023-11-19 07:40:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:32,987 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:40:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:32,991 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. cyclomatic complexity: 96 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 07:40:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:33,032 INFO L93 Difference]: Finished difference Result 338 states and 498 transitions. [2023-11-19 07:40:33,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 498 transitions. [2023-11-19 07:40:33,038 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2023-11-19 07:40:33,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 338 states and 498 transitions. [2023-11-19 07:40:33,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2023-11-19 07:40:33,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2023-11-19 07:40:33,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 338 states and 498 transitions. [2023-11-19 07:40:33,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:33,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2023-11-19 07:40:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states and 498 transitions. [2023-11-19 07:40:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2023-11-19 07:40:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.4733727810650887) internal successors, (498), 337 states have internal predecessors, (498), 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 07:40:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2023-11-19 07:40:33,101 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 498 transitions. [2023-11-19 07:40:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:33,106 INFO L428 stractBuchiCegarLoop]: Abstraction has 338 states and 498 transitions. [2023-11-19 07:40:33,106 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-19 07:40:33,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 498 transitions. [2023-11-19 07:40:33,109 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 336 [2023-11-19 07:40:33,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:33,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:33,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:33,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:33,111 INFO L748 eck$LassoCheckResult]: Stem: 1054#$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(15, 2);call #Ultimate.allocInit(12, 3); 1030#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_~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_~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_~cond~0#1; 1031#L113-1 [2023-11-19 07:40:33,112 INFO L750 eck$LassoCheckResult]: Loop: 1031#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 1076#L34 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; 1077#L53 assume !(0 != main_~p1~0#1); 1130#L53-2 assume !(0 != main_~p2~0#1); 1127#L57-1 assume !(0 != main_~p3~0#1); 1124#L61-1 assume !(0 != main_~p4~0#1); 1122#L65-1 assume !(0 != main_~p5~0#1); 1120#L69-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1117#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1113#L77-1 assume !(0 != main_~p1~0#1); 1109#L83-1 assume !(0 != main_~p2~0#1); 1107#L88-1 assume !(0 != main_~p3~0#1); 1103#L93-1 assume !(0 != main_~p4~0#1); 1100#L98-1 assume !(0 != main_~p5~0#1); 1101#L103-1 assume !(0 != main_~p6~0#1); 1096#L108-1 assume !(0 != main_~p7~0#1); 1031#L113-1 [2023-11-19 07:40:33,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-19 07:40:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316802433] [2023-11-19 07:40:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,121 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:33,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 937627012, now seen corresponding path program 1 times [2023-11-19 07:40:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891927688] [2023-11-19 07:40:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:33,164 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 07:40:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891927688] [2023-11-19 07:40:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891927688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:40:33,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762043989] [2023-11-19 07:40:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:33,167 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:40:33,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:33,169 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 07:40:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:33,193 INFO L93 Difference]: Finished difference Result 658 states and 946 transitions. [2023-11-19 07:40:33,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 946 transitions. [2023-11-19 07:40:33,202 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2023-11-19 07:40:33,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 658 states and 946 transitions. [2023-11-19 07:40:33,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 658 [2023-11-19 07:40:33,210 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 658 [2023-11-19 07:40:33,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 658 states and 946 transitions. [2023-11-19 07:40:33,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:33,213 INFO L218 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2023-11-19 07:40:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states and 946 transitions. [2023-11-19 07:40:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2023-11-19 07:40:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 658 states have (on average 1.4376899696048633) internal successors, (946), 657 states have internal predecessors, (946), 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 07:40:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 946 transitions. [2023-11-19 07:40:33,240 INFO L240 hiAutomatonCegarLoop]: Abstraction has 658 states and 946 transitions. [2023-11-19 07:40:33,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:33,241 INFO L428 stractBuchiCegarLoop]: Abstraction has 658 states and 946 transitions. [2023-11-19 07:40:33,242 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-19 07:40:33,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 946 transitions. [2023-11-19 07:40:33,247 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 656 [2023-11-19 07:40:33,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:33,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:33,248 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:33,248 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:33,249 INFO L748 eck$LassoCheckResult]: Stem: 2062#$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(15, 2);call #Ultimate.allocInit(12, 3); 2032#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_~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_~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_~cond~0#1; 2033#L113-1 [2023-11-19 07:40:33,249 INFO L750 eck$LassoCheckResult]: Loop: 2033#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 2204#L34 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; 2184#L53 assume !(0 != main_~p1~0#1); 2177#L53-2 assume !(0 != main_~p2~0#1); 2179#L57-1 assume !(0 != main_~p3~0#1); 2355#L61-1 assume !(0 != main_~p4~0#1); 2351#L65-1 assume !(0 != main_~p5~0#1); 2348#L69-1 assume !(0 != main_~p6~0#1); 2346#L73-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2344#L77-1 assume !(0 != main_~p1~0#1); 2342#L83-1 assume !(0 != main_~p2~0#1); 2340#L88-1 assume !(0 != main_~p3~0#1); 2337#L93-1 assume !(0 != main_~p4~0#1); 2336#L98-1 assume !(0 != main_~p5~0#1); 2333#L103-1 assume !(0 != main_~p6~0#1); 2334#L108-1 assume !(0 != main_~p7~0#1); 2033#L113-1 [2023-11-19 07:40:33,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,250 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-19 07:40:33,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735776699] [2023-11-19 07:40:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:33,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1617685382, now seen corresponding path program 1 times [2023-11-19 07:40:33,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185870059] [2023-11-19 07:40:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:40:33,299 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 07:40:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:40:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185870059] [2023-11-19 07:40:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185870059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:40:33,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:40:33,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:40:33,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908237874] [2023-11-19 07:40:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:40:33,302 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-19 07:40:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:40:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:40:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:40:33,303 INFO L87 Difference]: Start difference. First operand 658 states and 946 transitions. cyclomatic complexity: 320 Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 07:40:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:40:33,327 INFO L93 Difference]: Finished difference Result 1282 states and 1794 transitions. [2023-11-19 07:40:33,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1794 transitions. [2023-11-19 07:40:33,345 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2023-11-19 07:40:33,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1282 states and 1794 transitions. [2023-11-19 07:40:33,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1282 [2023-11-19 07:40:33,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1282 [2023-11-19 07:40:33,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1282 states and 1794 transitions. [2023-11-19 07:40:33,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:40:33,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2023-11-19 07:40:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states and 1794 transitions. [2023-11-19 07:40:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2023-11-19 07:40:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1282 states have (on average 1.3993759750390016) internal successors, (1794), 1281 states have internal predecessors, (1794), 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 07:40:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1794 transitions. [2023-11-19 07:40:33,420 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2023-11-19 07:40:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:40:33,423 INFO L428 stractBuchiCegarLoop]: Abstraction has 1282 states and 1794 transitions. [2023-11-19 07:40:33,423 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-19 07:40:33,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1282 states and 1794 transitions. [2023-11-19 07:40:33,433 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1280 [2023-11-19 07:40:33,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-19 07:40:33,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-19 07:40:33,435 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-19 07:40:33,435 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:40:33,436 INFO L748 eck$LassoCheckResult]: Stem: 4013#$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(15, 2);call #Ultimate.allocInit(12, 3); 3978#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_~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_~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_~cond~0#1; 3979#L113-1 [2023-11-19 07:40:33,436 INFO L750 eck$LassoCheckResult]: Loop: 3979#L113-1 assume !false;havoc main_#t~nondet11#1;main_~cond~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1; 4219#L34 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; 4217#L53 assume !(0 != main_~p1~0#1); 4212#L53-2 assume !(0 != main_~p2~0#1); 4206#L57-1 assume !(0 != main_~p3~0#1); 4201#L61-1 assume !(0 != main_~p4~0#1); 4202#L65-1 assume !(0 != main_~p5~0#1); 4249#L69-1 assume !(0 != main_~p6~0#1); 4247#L73-1 assume !(0 != main_~p7~0#1); 4243#L77-1 assume !(0 != main_~p1~0#1); 4235#L83-1 assume !(0 != main_~p2~0#1); 4234#L88-1 assume !(0 != main_~p3~0#1); 4081#L93-1 assume !(0 != main_~p4~0#1); 4082#L98-1 assume !(0 != main_~p5~0#1); 4226#L103-1 assume !(0 != main_~p6~0#1); 4223#L108-1 assume !(0 != main_~p7~0#1); 3979#L113-1 [2023-11-19 07:40:33,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-19 07:40:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008895476] [2023-11-19 07:40:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,454 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:33,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 808338756, now seen corresponding path program 1 times [2023-11-19 07:40:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198722384] [2023-11-19 07:40:33,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:33,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:40:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1317176582, now seen corresponding path program 1 times [2023-11-19 07:40:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:40:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046306524] [2023-11-19 07:40:33,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:40:33,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:40:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:40:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:40:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:40:33,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 07:40:33 BoogieIcfgContainer [2023-11-19 07:40:33,882 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-19 07:40:33,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:40:33,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:40:33,883 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:40:33,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:40:31" (3/4) ... [2023-11-19 07:40:33,885 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-19 07:40:33,944 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:40:33,944 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:40:33,945 INFO L158 Benchmark]: Toolchain (without parser) took 2732.49ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 105.6MB in the beginning and 94.5MB in the end (delta: 11.0MB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2023-11-19 07:40:33,946 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 140.5MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:40:33,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.07ms. Allocated memory is still 140.5MB. Free memory was 105.2MB in the beginning and 94.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:40:33,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.27ms. Allocated memory is still 140.5MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:40:33,947 INFO L158 Benchmark]: Boogie Preprocessor took 37.93ms. Allocated memory is still 140.5MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:40:33,947 INFO L158 Benchmark]: RCFGBuilder took 363.88ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 80.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:40:33,948 INFO L158 Benchmark]: BuchiAutomizer took 1910.07ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 80.5MB in the beginning and 96.6MB in the end (delta: -16.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2023-11-19 07:40:33,948 INFO L158 Benchmark]: Witness Printer took 61.91ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:40:33,950 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.63ms. Allocated memory is still 140.5MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.07ms. Allocated memory is still 140.5MB. Free memory was 105.2MB in the beginning and 94.7MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.27ms. Allocated memory is still 140.5MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.93ms. Allocated memory is still 140.5MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.88ms. Allocated memory is still 140.5MB. Free memory was 91.9MB in the beginning and 80.5MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1910.07ms. Allocated memory was 140.5MB in the beginning and 176.2MB in the end (delta: 35.7MB). Free memory was 80.5MB in the beginning and 96.6MB in the end (delta: -16.1MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 61.91ms. Allocated memory is still 176.2MB. Free memory was 96.6MB in the beginning and 94.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (6 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.6 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 1282 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 0. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s 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, 177 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 349 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI6 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: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: 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; [L30] int cond; Loop: [L32] COND TRUE 1 [L33] cond = __VERIFIER_nondet_int() [L34] COND FALSE !(cond == 0) [L37] lk1 = 0 [L39] lk2 = 0 [L41] lk3 = 0 [L43] lk4 = 0 [L45] lk5 = 0 [L47] lk6 = 0 [L49] lk7 = 0 [L53] COND FALSE !(p1 != 0) [L57] COND FALSE !(p2 != 0) [L61] COND FALSE !(p3 != 0) [L65] COND FALSE !(p4 != 0) [L69] COND FALSE !(p5 != 0) [L73] COND FALSE !(p6 != 0) [L77] COND FALSE !(p7 != 0) [L83] COND FALSE !(p1 != 0) [L88] COND FALSE !(p2 != 0) [L93] COND FALSE !(p3 != 0) [L98] COND FALSE !(p4 != 0) [L103] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L113] COND FALSE !(p7 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-19 07:40:34,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc55efd9-0409-4398-a2ee-b95458545594/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)