./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_6.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme --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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:55:37,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:55:37,739 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 11:55:37,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:55:37,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:55:37,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:55:37,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:55:37,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:55:37,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:55:37,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:55:37,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:55:37,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:55:37,780 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:55:37,781 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 11:55:37,781 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 11:55:37,782 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 11:55:37,783 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 11:55:37,783 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 11:55:37,784 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 11:55:37,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:55:37,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 11:55:37,786 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:55:37,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:55:37,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:55:37,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:55:37,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 11:55:37,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 11:55:37,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 11:55:37,789 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:55:37,789 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:55:37,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:55:37,790 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 11:55:37,791 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:55:37,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:55:37,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:55:37,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:55:37,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:55:37,793 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 11:55:37,793 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_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/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_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2023-11-26 11:55:38,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:55:38,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:55:38,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:55:38,054 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:55:38,055 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:55:38,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/locks/test_locks_6.c [2023-11-26 11:55:41,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:55:41,531 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:55:41,532 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/sv-benchmarks/c/locks/test_locks_6.c [2023-11-26 11:55:41,540 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/data/48433c7f9/b9612ba83ce44a358cb175077f43643c/FLAG7ae36a50f [2023-11-26 11:55:41,559 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/data/48433c7f9/b9612ba83ce44a358cb175077f43643c [2023-11-26 11:55:41,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:55:41,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:55:41,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:55:41,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:55:41,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:55:41,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17bec247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41, skipping insertion in model container [2023-11-26 11:55:41,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:55:41,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:55:41,808 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:55:41,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:55:41,848 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:55:41,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41 WrapperNode [2023-11-26 11:55:41,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:55:41,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:55:41,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:55:41,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:55:41,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,889 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 94 [2023-11-26 11:55:41,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:55:41,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:55:41,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:55:41,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:55:41,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,916 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:55:41,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:55:41,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:55:41,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:55:41,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:55:41,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (1/1) ... [2023-11-26 11:55:41,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:55:41,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:55:41,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:55:41,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 11:55:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:55:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:55:42,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:55:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:55:42,121 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:55:42,124 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:55:42,369 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:55:42,387 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:55:42,387 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:55:42,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:55:42 BoogieIcfgContainer [2023-11-26 11:55:42,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:55:42,391 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 11:55:42,391 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 11:55:42,396 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 11:55:42,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:55:42,398 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 11:55:41" (1/3) ... [2023-11-26 11:55:42,399 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1539fedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:55:42, skipping insertion in model container [2023-11-26 11:55:42,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:55:42,401 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:55:41" (2/3) ... [2023-11-26 11:55:42,403 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1539fedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:55:42, skipping insertion in model container [2023-11-26 11:55:42,403 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:55:42,404 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:55:42" (3/3) ... [2023-11-26 11:55:42,405 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_6.c [2023-11-26 11:55:42,484 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 11:55:42,485 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 11:55:42,491 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 11:55:42,492 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 11:55:42,492 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 11:55:42,492 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 11:55:42,493 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 11:55:42,493 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 11:55:42,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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-26 11:55:42,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-11-26 11:55:42,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:42,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:42,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:42,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:42,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 11:55:42,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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-26 11:55:42,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2023-11-26 11:55:42,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:42,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:42,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:42,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:42,555 INFO L748 eck$LassoCheckResult]: Stem: 26#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 7#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_~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_~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_~cond~0#1; 10#L99-1true [2023-11-26 11:55:42,556 INFO L750 eck$LassoCheckResult]: Loop: 10#L99-1true assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 6#L31true 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; 14#L48true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 3#L48-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 28#L52-1true assume !(0 != main_~p3~0#1); 18#L56-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 5#L60-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 23#L64-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 21#L68-1true assume !(0 != main_~p1~0#1); 27#L74-1true assume !(0 != main_~p2~0#1); 12#L79-1true assume !(0 != main_~p3~0#1); 20#L84-1true assume !(0 != main_~p4~0#1); 13#L89-1true assume !(0 != main_~p5~0#1); 9#L94-1true assume !(0 != main_~p6~0#1); 10#L99-1true [2023-11-26 11:55:42,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-26 11:55:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568445749] [2023-11-26 11:55:42,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:42,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:42,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:42,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash -11500681, now seen corresponding path program 1 times [2023-11-26 11:55:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929914686] [2023-11-26 11:55:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:42,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:42,859 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-26 11:55:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929914686] [2023-11-26 11:55:42,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929914686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:42,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:42,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227828101] [2023-11-26 11:55:42,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:42,866 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:42,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:42,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:55:42,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:55:42,902 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 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 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-26 11:55:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:42,935 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2023-11-26 11:55:42,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 81 transitions. [2023-11-26 11:55:42,939 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2023-11-26 11:55:42,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 41 states and 63 transitions. [2023-11-26 11:55:42,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-11-26 11:55:42,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-11-26 11:55:42,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 63 transitions. [2023-11-26 11:55:42,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:42,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-11-26 11:55:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 63 transitions. [2023-11-26 11:55:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-26 11:55:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 40 states have internal predecessors, (63), 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-26 11:55:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 63 transitions. [2023-11-26 11:55:42,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-11-26 11:55:42,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:55:42,983 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 63 transitions. [2023-11-26 11:55:42,983 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 11:55:42,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 63 transitions. [2023-11-26 11:55:42,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2023-11-26 11:55:42,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:42,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:42,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:42,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:42,986 INFO L748 eck$LassoCheckResult]: Stem: 108#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 101#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_~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_~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_~cond~0#1; 100#L99-1 [2023-11-26 11:55:42,987 INFO L750 eck$LassoCheckResult]: Loop: 100#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 107#L31 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; 116#L48 assume !(0 != main_~p1~0#1); 86#L48-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 87#L52-1 assume !(0 != main_~p3~0#1); 115#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 114#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 113#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 112#L68-1 assume !(0 != main_~p1~0#1); 109#L74-1 assume !(0 != main_~p2~0#1); 105#L79-1 assume !(0 != main_~p3~0#1); 89#L84-1 assume !(0 != main_~p4~0#1); 93#L89-1 assume !(0 != main_~p5~0#1); 91#L94-1 assume !(0 != main_~p6~0#1); 100#L99-1 [2023-11-26 11:55:42,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-26 11:55:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:42,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163082387] [2023-11-26 11:55:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:42,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:42,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:43,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash 246664757, now seen corresponding path program 1 times [2023-11-26 11:55:43,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807501690] [2023-11-26 11:55:43,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:43,042 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-26 11:55:43,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:43,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807501690] [2023-11-26 11:55:43,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807501690] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:43,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:43,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:43,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911278869] [2023-11-26 11:55:43,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:43,044 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:43,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:55:43,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:55:43,045 INFO L87 Difference]: Start difference. First operand 41 states and 63 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-26 11:55:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:43,063 INFO L93 Difference]: Finished difference Result 78 states and 118 transitions. [2023-11-26 11:55:43,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 118 transitions. [2023-11-26 11:55:43,065 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2023-11-26 11:55:43,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 118 transitions. [2023-11-26 11:55:43,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2023-11-26 11:55:43,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2023-11-26 11:55:43,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 118 transitions. [2023-11-26 11:55:43,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:43,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2023-11-26 11:55:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 118 transitions. [2023-11-26 11:55:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-26 11:55:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 77 states have internal predecessors, (118), 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-26 11:55:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2023-11-26 11:55:43,078 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 118 transitions. [2023-11-26 11:55:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:55:43,080 INFO L428 stractBuchiCegarLoop]: Abstraction has 78 states and 118 transitions. [2023-11-26 11:55:43,080 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 11:55:43,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 118 transitions. [2023-11-26 11:55:43,082 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2023-11-26 11:55:43,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:43,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:43,083 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:43,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:43,083 INFO L748 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 224#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_~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_~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_~cond~0#1; 225#L99-1 [2023-11-26 11:55:43,083 INFO L750 eck$LassoCheckResult]: Loop: 225#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 262#L31 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; 259#L48 assume !(0 != main_~p1~0#1); 258#L48-2 assume !(0 != main_~p2~0#1); 237#L52-1 assume !(0 != main_~p3~0#1); 238#L56-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 254#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 253#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 252#L68-1 assume !(0 != main_~p1~0#1); 239#L74-1 assume !(0 != main_~p2~0#1); 241#L79-1 assume !(0 != main_~p3~0#1); 287#L84-1 assume !(0 != main_~p4~0#1); 285#L89-1 assume !(0 != main_~p5~0#1); 269#L94-1 assume !(0 != main_~p6~0#1); 225#L99-1 [2023-11-26 11:55:43,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-26 11:55:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57458991] [2023-11-26 11:55:43,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:43,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash 947729335, now seen corresponding path program 1 times [2023-11-26 11:55:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783685452] [2023-11-26 11:55:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:43,151 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-26 11:55:43,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:43,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783685452] [2023-11-26 11:55:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783685452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962833771] [2023-11-26 11:55:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:43,153 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:55:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:55:43,154 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-26 11:55:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:43,174 INFO L93 Difference]: Finished difference Result 150 states and 222 transitions. [2023-11-26 11:55:43,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 222 transitions. [2023-11-26 11:55:43,179 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2023-11-26 11:55:43,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 222 transitions. [2023-11-26 11:55:43,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2023-11-26 11:55:43,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2023-11-26 11:55:43,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 222 transitions. [2023-11-26 11:55:43,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:43,185 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2023-11-26 11:55:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 222 transitions. [2023-11-26 11:55:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-11-26 11:55:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.48) internal successors, (222), 149 states have internal predecessors, (222), 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-26 11:55:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2023-11-26 11:55:43,202 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 222 transitions. [2023-11-26 11:55:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:55:43,204 INFO L428 stractBuchiCegarLoop]: Abstraction has 150 states and 222 transitions. [2023-11-26 11:55:43,204 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 11:55:43,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 222 transitions. [2023-11-26 11:55:43,207 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 148 [2023-11-26 11:55:43,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:43,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:43,208 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:43,208 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:43,208 INFO L748 eck$LassoCheckResult]: Stem: 468#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 458#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_~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_~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_~cond~0#1; 459#L99-1 [2023-11-26 11:55:43,208 INFO L750 eck$LassoCheckResult]: Loop: 459#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 500#L31 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; 495#L48 assume !(0 != main_~p1~0#1); 490#L48-2 assume !(0 != main_~p2~0#1); 483#L52-1 assume !(0 != main_~p3~0#1); 484#L56-1 assume !(0 != main_~p4~0#1); 543#L60-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 542#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 536#L68-1 assume !(0 != main_~p1~0#1); 538#L74-1 assume !(0 != main_~p2~0#1); 535#L79-1 assume !(0 != main_~p3~0#1); 533#L84-1 assume !(0 != main_~p4~0#1); 532#L89-1 assume !(0 != main_~p5~0#1); 514#L94-1 assume !(0 != main_~p6~0#1); 459#L99-1 [2023-11-26 11:55:43,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-26 11:55:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834854828] [2023-11-26 11:55:43,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,216 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:43,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1627787705, now seen corresponding path program 1 times [2023-11-26 11:55:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546068940] [2023-11-26 11:55:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:43,291 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-26 11:55:43,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546068940] [2023-11-26 11:55:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546068940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:43,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:43,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:55:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008825579] [2023-11-26 11:55:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:43,293 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:43,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:55:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:55:43,294 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-26 11:55:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:43,340 INFO L93 Difference]: Finished difference Result 290 states and 418 transitions. [2023-11-26 11:55:43,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 290 states and 418 transitions. [2023-11-26 11:55:43,346 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2023-11-26 11:55:43,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 290 states to 290 states and 418 transitions. [2023-11-26 11:55:43,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 290 [2023-11-26 11:55:43,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 290 [2023-11-26 11:55:43,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 290 states and 418 transitions. [2023-11-26 11:55:43,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:43,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2023-11-26 11:55:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states and 418 transitions. [2023-11-26 11:55:43,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2023-11-26 11:55:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4413793103448276) internal successors, (418), 289 states have internal predecessors, (418), 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-26 11:55:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 418 transitions. [2023-11-26 11:55:43,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 290 states and 418 transitions. [2023-11-26 11:55:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:55:43,402 INFO L428 stractBuchiCegarLoop]: Abstraction has 290 states and 418 transitions. [2023-11-26 11:55:43,402 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 11:55:43,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 418 transitions. [2023-11-26 11:55:43,405 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 288 [2023-11-26 11:55:43,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:43,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:43,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:43,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:43,406 INFO L748 eck$LassoCheckResult]: Stem: 918#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 905#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_~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_~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_~cond~0#1; 906#L99-1 [2023-11-26 11:55:43,407 INFO L750 eck$LassoCheckResult]: Loop: 906#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 960#L31 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; 958#L48 assume !(0 != main_~p1~0#1); 954#L48-2 assume !(0 != main_~p2~0#1); 952#L52-1 assume !(0 != main_~p3~0#1); 948#L56-1 assume !(0 != main_~p4~0#1); 944#L60-1 assume !(0 != main_~p5~0#1); 942#L64-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 939#L68-1 assume !(0 != main_~p1~0#1); 940#L74-1 assume !(0 != main_~p2~0#1); 976#L79-1 assume !(0 != main_~p3~0#1); 971#L84-1 assume !(0 != main_~p4~0#1); 967#L89-1 assume !(0 != main_~p5~0#1); 964#L94-1 assume !(0 != main_~p6~0#1); 906#L99-1 [2023-11-26 11:55:43,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,407 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-26 11:55:43,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622913679] [2023-11-26 11:55:43,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:43,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 818441079, now seen corresponding path program 1 times [2023-11-26 11:55:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908531005] [2023-11-26 11:55:43,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:55:43,472 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-26 11:55:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:55:43,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908531005] [2023-11-26 11:55:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908531005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:55:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:55:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:55:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507153851] [2023-11-26 11:55:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:55:43,480 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:55:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:55:43,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:55:43,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:55:43,481 INFO L87 Difference]: Start difference. First operand 290 states and 418 transitions. cyclomatic complexity: 144 Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-26 11:55:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:55:43,506 INFO L93 Difference]: Finished difference Result 562 states and 786 transitions. [2023-11-26 11:55:43,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 562 states and 786 transitions. [2023-11-26 11:55:43,511 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2023-11-26 11:55:43,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 562 states to 562 states and 786 transitions. [2023-11-26 11:55:43,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 562 [2023-11-26 11:55:43,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 562 [2023-11-26 11:55:43,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 786 transitions. [2023-11-26 11:55:43,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:55:43,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2023-11-26 11:55:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 786 transitions. [2023-11-26 11:55:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2023-11-26 11:55:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 562 states have (on average 1.398576512455516) internal successors, (786), 561 states have internal predecessors, (786), 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-26 11:55:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 786 transitions. [2023-11-26 11:55:43,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 562 states and 786 transitions. [2023-11-26 11:55:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:55:43,556 INFO L428 stractBuchiCegarLoop]: Abstraction has 562 states and 786 transitions. [2023-11-26 11:55:43,556 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 11:55:43,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 562 states and 786 transitions. [2023-11-26 11:55:43,560 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 560 [2023-11-26 11:55:43,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:55:43,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:55:43,561 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-26 11:55:43,561 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:55:43,561 INFO L748 eck$LassoCheckResult]: Stem: 1774#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); 1763#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_~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_~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_~cond~0#1; 1764#L99-1 [2023-11-26 11:55:43,562 INFO L750 eck$LassoCheckResult]: Loop: 1764#L99-1 assume !false;havoc main_#t~nondet10#1;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; 1830#L31 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; 1828#L48 assume !(0 != main_~p1~0#1); 1824#L48-2 assume !(0 != main_~p2~0#1); 1822#L52-1 assume !(0 != main_~p3~0#1); 1818#L56-1 assume !(0 != main_~p4~0#1); 1814#L60-1 assume !(0 != main_~p5~0#1); 1810#L64-1 assume !(0 != main_~p6~0#1); 1807#L68-1 assume !(0 != main_~p1~0#1); 1808#L74-1 assume !(0 != main_~p2~0#1); 1846#L79-1 assume !(0 != main_~p3~0#1); 1841#L84-1 assume !(0 != main_~p4~0#1); 1837#L89-1 assume !(0 != main_~p5~0#1); 1833#L94-1 assume !(0 != main_~p6~0#1); 1764#L99-1 [2023-11-26 11:55:43,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-26 11:55:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728713209] [2023-11-26 11:55:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:43,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1701518855, now seen corresponding path program 1 times [2023-11-26 11:55:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346865498] [2023-11-26 11:55:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:43,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:55:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1159342651, now seen corresponding path program 1 times [2023-11-26 11:55:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:55:43,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306885250] [2023-11-26 11:55:43,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:55:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:55:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:43,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:55:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:44,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:55:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:55:44,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.11 11:55:44 BoogieIcfgContainer [2023-11-26 11:55:44,061 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-26 11:55:44,062 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:55:44,062 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:55:44,062 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:55:44,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:55:42" (3/4) ... [2023-11-26 11:55:44,064 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-26 11:55:44,135 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:55:44,148 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:55:44,149 INFO L158 Benchmark]: Toolchain (without parser) took 2575.91ms. Allocated memory is still 155.2MB. Free memory was 123.7MB in the beginning and 79.1MB in the end (delta: 44.7MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,150 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 111.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:55:44,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.06ms. Allocated memory is still 155.2MB. Free memory was 123.7MB in the beginning and 112.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.86ms. Allocated memory is still 155.2MB. Free memory was 112.5MB in the beginning and 111.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,151 INFO L158 Benchmark]: Boogie Preprocessor took 39.23ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,151 INFO L158 Benchmark]: RCFGBuilder took 459.13ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 98.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,152 INFO L158 Benchmark]: BuchiAutomizer took 1670.32ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 81.2MB in the end (delta: 16.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,157 INFO L158 Benchmark]: Witness Printer took 86.66ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:55:44,159 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.40ms. Allocated memory is still 111.1MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.06ms. Allocated memory is still 155.2MB. Free memory was 123.7MB in the beginning and 112.5MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.86ms. Allocated memory is still 155.2MB. Free memory was 112.5MB in the beginning and 111.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.23ms. Allocated memory is still 155.2MB. Free memory was 110.9MB in the beginning and 109.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 459.13ms. Allocated memory is still 155.2MB. Free memory was 109.3MB in the beginning and 98.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1670.32ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 81.2MB in the end (delta: 16.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 86.66ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 79.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 562 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s 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, 128 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 255 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI5 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: 29]: 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; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: 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; [L27] int cond; Loop: [L29] COND TRUE 1 [L30] cond = __VERIFIER_nondet_int() [L31] COND FALSE !(cond == 0) [L34] lk1 = 0 [L36] lk2 = 0 [L38] lk3 = 0 [L40] lk4 = 0 [L42] lk5 = 0 [L44] lk6 = 0 [L48] COND FALSE !(p1 != 0) [L52] COND FALSE !(p2 != 0) [L56] COND FALSE !(p3 != 0) [L60] COND FALSE !(p4 != 0) [L64] COND FALSE !(p5 != 0) [L68] COND FALSE !(p6 != 0) [L74] COND FALSE !(p1 != 0) [L79] COND FALSE !(p2 != 0) [L84] COND FALSE !(p3 != 0) [L89] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L99] COND FALSE !(p6 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-26 11:55:44,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ce0d139-fb0c-4ddc-afd5-ed4efc771c1b/bin/uautomizer-verify-VRDe98Ueme/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)