./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e7bb482b 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_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:41:24,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:41:24,259 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-06 22:41:24,265 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:41:24,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:41:24,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:41:24,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:41:24,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:41:24,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:41:24,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:41:24,313 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:41:24,314 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-06 22:41:24,315 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-06 22:41:24,316 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-06 22:41:24,317 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-06 22:41:24,317 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-06 22:41:24,318 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-06 22:41:24,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:41:24,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-06 22:41:24,319 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:41:24,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:41:24,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:41:24,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:41:24,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-06 22:41:24,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-06 22:41:24,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-06 22:41:24,323 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:41:24,323 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:41:24,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:41:24,324 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-06 22:41:24,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:41:24,326 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:41:24,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:41:24,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:41:24,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:41:24,328 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-06 22:41:24,328 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_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/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_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> b7157ba450d9d62b74d19027a6860eb7210e35a76921ceb23a9c0a69add85337 [2023-11-06 22:41:24,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:41:24,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:41:24,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:41:24,708 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:41:24,709 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:41:24,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/locks/test_locks_8.c [2023-11-06 22:41:27,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:41:28,113 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:41:28,114 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/sv-benchmarks/c/locks/test_locks_8.c [2023-11-06 22:41:28,123 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/data/84853bcc5/ff7cc5fd069940cda697a006d95205d2/FLAGf56780b96 [2023-11-06 22:41:28,140 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/data/84853bcc5/ff7cc5fd069940cda697a006d95205d2 [2023-11-06 22:41:28,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:41:28,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:41:28,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:28,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:41:28,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:41:28,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1efaae85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28, skipping insertion in model container [2023-11-06 22:41:28,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,190 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:41:28,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:28,413 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:41:28,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:41:28,450 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:41:28,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28 WrapperNode [2023-11-06 22:41:28,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:41:28,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:28,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:41:28,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:41:28,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,487 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2023-11-06 22:41:28,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:41:28,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:41:28,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:41:28,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:41:28,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:41:28,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:41:28,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:41:28,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:41:28,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (1/1) ... [2023-11-06 22:41:28,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-06 22:41:28,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:41:28,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-06 22:41:28,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-06 22:41:28,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:41:28,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:41:28,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:41:28,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:41:28,660 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:41:28,662 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:41:28,844 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:41:28,850 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:41:28,850 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:41:28,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:28 BoogieIcfgContainer [2023-11-06 22:41:28,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:41:28,854 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-06 22:41:28,854 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-06 22:41:28,860 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-06 22:41:28,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:41:28,861 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.11 10:41:28" (1/3) ... [2023-11-06 22:41:28,863 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66da7409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:41:28, skipping insertion in model container [2023-11-06 22:41:28,863 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:41:28,863 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:41:28" (2/3) ... [2023-11-06 22:41:28,865 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66da7409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.11 10:41:28, skipping insertion in model container [2023-11-06 22:41:28,865 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-06 22:41:28,866 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:28" (3/3) ... [2023-11-06 22:41:28,870 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_8.c [2023-11-06 22:41:28,942 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-06 22:41:28,942 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-06 22:41:28,942 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-06 22:41:28,942 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-06 22:41:28,942 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-06 22:41:28,942 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-06 22:41:28,943 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-06 22:41:28,943 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-06 22:41:28,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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-06 22:41:28,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-11-06 22:41:28,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:28,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:28,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:28,989 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:28,989 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-06 22:41:28,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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-06 22:41:28,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-11-06 22:41:28,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:28,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:29,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:29,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,008 INFO L748 eck$LassoCheckResult]: Stem: 32#$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); 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_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 19#L127-1true [2023-11-06 22:41:29,010 INFO L750 eck$LassoCheckResult]: Loop: 19#L127-1true assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 27#L37true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 6#L58true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 13#L58-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 15#L62-1true assume !(0 != main_~p3~0#1); 28#L66-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 30#L70-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 33#L74-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 24#L78-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 10#L82-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8#L86-1true assume !(0 != main_~p1~0#1); 5#L92-1true assume !(0 != main_~p2~0#1); 16#L97-1true assume !(0 != main_~p3~0#1); 21#L102-1true assume !(0 != main_~p4~0#1); 18#L107-1true assume !(0 != main_~p5~0#1); 34#L112-1true assume !(0 != main_~p6~0#1); 31#L117-1true assume !(0 != main_~p7~0#1); 11#L122-1true assume !(0 != main_~p8~0#1); 19#L127-1true [2023-11-06 22:41:29,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-11-06 22:41:29,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214963770] [2023-11-06 22:41:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:29,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1098697512, now seen corresponding path program 1 times [2023-11-06 22:41:29,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134808032] [2023-11-06 22:41:29,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,367 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-06 22:41:29,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134808032] [2023-11-06 22:41:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134808032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550750001] [2023-11-06 22:41:29,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,375 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:29,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:29,417 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,484 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2023-11-06 22:41:29,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 105 transitions. [2023-11-06 22:41:29,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2023-11-06 22:41:29,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 53 states and 83 transitions. [2023-11-06 22:41:29,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2023-11-06 22:41:29,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2023-11-06 22:41:29,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 83 transitions. [2023-11-06 22:41:29,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:29,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-11-06 22:41:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 83 transitions. [2023-11-06 22:41:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-06 22:41:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 52 states have internal predecessors, (83), 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-06 22:41:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2023-11-06 22:41:29,545 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-11-06 22:41:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:29,551 INFO L428 stractBuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2023-11-06 22:41:29,551 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-06 22:41:29,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2023-11-06 22:41:29,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2023-11-06 22:41:29,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:29,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:29,558 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:29,559 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,560 INFO L748 eck$LassoCheckResult]: Stem: 136#$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); 111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 112#L127-1 [2023-11-06 22:41:29,560 INFO L750 eck$LassoCheckResult]: Loop: 112#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 139#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 137#L58 assume !(0 != main_~p1~0#1); 138#L58-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 156#L62-1 assume !(0 != main_~p3~0#1); 155#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 153#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 152#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 151#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 150#L86-1 assume !(0 != main_~p1~0#1); 108#L92-1 assume !(0 != main_~p2~0#1); 107#L97-1 assume !(0 != main_~p3~0#1); 122#L102-1 assume !(0 != main_~p4~0#1); 127#L107-1 assume !(0 != main_~p5~0#1); 142#L112-1 assume !(0 != main_~p6~0#1); 135#L117-1 assume !(0 != main_~p7~0#1); 129#L122-1 assume !(0 != main_~p8~0#1); 112#L127-1 [2023-11-06 22:41:29,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-11-06 22:41:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219708623] [2023-11-06 22:41:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:29,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,602 INFO L85 PathProgramCache]: Analyzing trace with hash 77629158, now seen corresponding path program 1 times [2023-11-06 22:41:29,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362415641] [2023-11-06 22:41:29,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,673 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-06 22:41:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362415641] [2023-11-06 22:41:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362415641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170547688] [2023-11-06 22:41:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,676 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:29,677 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,696 INFO L93 Difference]: Finished difference Result 102 states and 158 transitions. [2023-11-06 22:41:29,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 158 transitions. [2023-11-06 22:41:29,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2023-11-06 22:41:29,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 158 transitions. [2023-11-06 22:41:29,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2023-11-06 22:41:29,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2023-11-06 22:41:29,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 158 transitions. [2023-11-06 22:41:29,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:29,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2023-11-06 22:41:29,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 158 transitions. [2023-11-06 22:41:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-06 22:41:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 101 states have internal predecessors, (158), 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-06 22:41:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2023-11-06 22:41:29,717 INFO L240 hiAutomatonCegarLoop]: Abstraction has 102 states and 158 transitions. [2023-11-06 22:41:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:29,719 INFO L428 stractBuchiCegarLoop]: Abstraction has 102 states and 158 transitions. [2023-11-06 22:41:29,719 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-06 22:41:29,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 158 transitions. [2023-11-06 22:41:29,721 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 100 [2023-11-06 22:41:29,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:29,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:29,722 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:29,722 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,722 INFO L748 eck$LassoCheckResult]: Stem: 299#$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); 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 273#L127-1 [2023-11-06 22:41:29,722 INFO L750 eck$LassoCheckResult]: Loop: 273#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 321#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 319#L58 assume !(0 != main_~p1~0#1); 316#L58-2 assume !(0 != main_~p2~0#1); 314#L62-1 assume !(0 != main_~p3~0#1); 312#L66-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 310#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 308#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 306#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 304#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 303#L86-1 assume !(0 != main_~p1~0#1); 300#L92-1 assume !(0 != main_~p2~0#1); 301#L97-1 assume !(0 != main_~p3~0#1); 343#L102-1 assume !(0 != main_~p4~0#1); 337#L107-1 assume !(0 != main_~p5~0#1); 332#L112-1 assume !(0 != main_~p6~0#1); 329#L117-1 assume !(0 != main_~p7~0#1); 325#L122-1 assume !(0 != main_~p8~0#1); 273#L127-1 [2023-11-06 22:41:29,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-11-06 22:41:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171312364] [2023-11-06 22:41:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,731 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:29,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1202234520, now seen corresponding path program 1 times [2023-11-06 22:41:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790232806] [2023-11-06 22:41:29,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,775 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-06 22:41:29,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790232806] [2023-11-06 22:41:29,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790232806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343264189] [2023-11-06 22:41:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,778 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:29,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:29,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:29,779 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,798 INFO L93 Difference]: Finished difference Result 198 states and 302 transitions. [2023-11-06 22:41:29,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 302 transitions. [2023-11-06 22:41:29,801 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2023-11-06 22:41:29,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 302 transitions. [2023-11-06 22:41:29,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 198 [2023-11-06 22:41:29,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2023-11-06 22:41:29,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 302 transitions. [2023-11-06 22:41:29,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:29,807 INFO L218 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2023-11-06 22:41:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 302 transitions. [2023-11-06 22:41:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-11-06 22:41:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.5252525252525253) internal successors, (302), 197 states have internal predecessors, (302), 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-06 22:41:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 302 transitions. [2023-11-06 22:41:29,823 INFO L240 hiAutomatonCegarLoop]: Abstraction has 198 states and 302 transitions. [2023-11-06 22:41:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:29,825 INFO L428 stractBuchiCegarLoop]: Abstraction has 198 states and 302 transitions. [2023-11-06 22:41:29,825 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-06 22:41:29,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 302 transitions. [2023-11-06 22:41:29,827 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 196 [2023-11-06 22:41:29,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:29,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:29,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:29,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,828 INFO L748 eck$LassoCheckResult]: Stem: 605#$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); 578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 579#L127-1 [2023-11-06 22:41:29,829 INFO L750 eck$LassoCheckResult]: Loop: 579#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 667#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 665#L58 assume !(0 != main_~p1~0#1); 666#L58-2 assume !(0 != main_~p2~0#1); 718#L62-1 assume !(0 != main_~p3~0#1); 706#L66-1 assume !(0 != main_~p4~0#1); 707#L70-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 716#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 705#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 702#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 692#L86-1 assume !(0 != main_~p1~0#1); 687#L92-1 assume !(0 != main_~p2~0#1); 685#L97-1 assume !(0 != main_~p3~0#1); 680#L102-1 assume !(0 != main_~p4~0#1); 677#L107-1 assume !(0 != main_~p5~0#1); 673#L112-1 assume !(0 != main_~p6~0#1); 671#L117-1 assume !(0 != main_~p7~0#1); 669#L122-1 assume !(0 != main_~p8~0#1); 579#L127-1 [2023-11-06 22:41:29,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,829 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2023-11-06 22:41:29,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142336237] [2023-11-06 22:41:29,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:29,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1789040534, now seen corresponding path program 1 times [2023-11-06 22:41:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054189798] [2023-11-06 22:41:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:29,873 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-06 22:41:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054189798] [2023-11-06 22:41:29,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054189798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:29,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592895220] [2023-11-06 22:41:29,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,875 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:29,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:29,876 INFO L87 Difference]: Start difference. First operand 198 states and 302 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:29,896 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2023-11-06 22:41:29,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 578 transitions. [2023-11-06 22:41:29,900 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2023-11-06 22:41:29,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 386 states and 578 transitions. [2023-11-06 22:41:29,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 386 [2023-11-06 22:41:29,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 386 [2023-11-06 22:41:29,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 386 states and 578 transitions. [2023-11-06 22:41:29,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:29,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2023-11-06 22:41:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 578 transitions. [2023-11-06 22:41:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2023-11-06 22:41:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 386 states have (on average 1.4974093264248705) internal successors, (578), 385 states have internal predecessors, (578), 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-06 22:41:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2023-11-06 22:41:29,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 386 states and 578 transitions. [2023-11-06 22:41:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:29,955 INFO L428 stractBuchiCegarLoop]: Abstraction has 386 states and 578 transitions. [2023-11-06 22:41:29,955 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-06 22:41:29,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 578 transitions. [2023-11-06 22:41:29,959 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 384 [2023-11-06 22:41:29,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:29,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:29,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:29,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,960 INFO L748 eck$LassoCheckResult]: Stem: 1198#$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); 1169#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 1170#L127-1 [2023-11-06 22:41:29,960 INFO L750 eck$LassoCheckResult]: Loop: 1170#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 1274#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 1259#L58 assume !(0 != main_~p1~0#1); 1261#L58-2 assume !(0 != main_~p2~0#1); 1239#L62-1 assume !(0 != main_~p3~0#1); 1240#L66-1 assume !(0 != main_~p4~0#1); 1351#L70-1 assume !(0 != main_~p5~0#1); 1343#L74-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1344#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1335#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1336#L86-1 assume !(0 != main_~p1~0#1); 1369#L92-1 assume !(0 != main_~p2~0#1); 1367#L97-1 assume !(0 != main_~p3~0#1); 1365#L102-1 assume !(0 != main_~p4~0#1); 1363#L107-1 assume !(0 != main_~p5~0#1); 1360#L112-1 assume !(0 != main_~p6~0#1); 1358#L117-1 assume !(0 != main_~p7~0#1); 1355#L122-1 assume !(0 != main_~p8~0#1); 1170#L127-1 [2023-11-06 22:41:29,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,961 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2023-11-06 22:41:29,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043173053] [2023-11-06 22:41:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:29,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:29,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1530875096, now seen corresponding path program 1 times [2023-11-06 22:41:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476717275] [2023-11-06 22:41:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:29,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,043 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-06 22:41:30,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476717275] [2023-11-06 22:41:30,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476717275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:30,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684770137] [2023-11-06 22:41:30,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,048 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:30,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:30,054 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,083 INFO L93 Difference]: Finished difference Result 754 states and 1106 transitions. [2023-11-06 22:41:30,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 754 states and 1106 transitions. [2023-11-06 22:41:30,093 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2023-11-06 22:41:30,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 754 states to 754 states and 1106 transitions. [2023-11-06 22:41:30,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 754 [2023-11-06 22:41:30,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 754 [2023-11-06 22:41:30,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 754 states and 1106 transitions. [2023-11-06 22:41:30,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:30,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2023-11-06 22:41:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states and 1106 transitions. [2023-11-06 22:41:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2023-11-06 22:41:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 754 states have (on average 1.46684350132626) internal successors, (1106), 753 states have internal predecessors, (1106), 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-06 22:41:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1106 transitions. [2023-11-06 22:41:30,174 INFO L240 hiAutomatonCegarLoop]: Abstraction has 754 states and 1106 transitions. [2023-11-06 22:41:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:30,177 INFO L428 stractBuchiCegarLoop]: Abstraction has 754 states and 1106 transitions. [2023-11-06 22:41:30,177 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-06 22:41:30,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 754 states and 1106 transitions. [2023-11-06 22:41:30,184 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 752 [2023-11-06 22:41:30,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:30,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:30,186 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:30,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,186 INFO L748 eck$LassoCheckResult]: Stem: 2345#$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); 2315#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 2316#L127-1 [2023-11-06 22:41:30,187 INFO L750 eck$LassoCheckResult]: Loop: 2316#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 2408#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 2404#L58 assume !(0 != main_~p1~0#1); 2402#L58-2 assume !(0 != main_~p2~0#1); 2400#L62-1 assume !(0 != main_~p3~0#1); 2396#L66-1 assume !(0 != main_~p4~0#1); 2392#L70-1 assume !(0 != main_~p5~0#1); 2388#L74-1 assume !(0 != main_~p6~0#1); 2386#L78-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2384#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2380#L86-1 assume !(0 != main_~p1~0#1); 2378#L92-1 assume !(0 != main_~p2~0#1); 2370#L97-1 assume !(0 != main_~p3~0#1); 2371#L102-1 assume !(0 != main_~p4~0#1); 2423#L107-1 assume !(0 != main_~p5~0#1); 2419#L112-1 assume !(0 != main_~p6~0#1); 2416#L117-1 assume !(0 != main_~p7~0#1); 2412#L122-1 assume !(0 != main_~p8~0#1); 2316#L127-1 [2023-11-06 22:41:30,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2023-11-06 22:41:30,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120351213] [2023-11-06 22:41:30,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:30,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash -829810518, now seen corresponding path program 1 times [2023-11-06 22:41:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101687351] [2023-11-06 22:41:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,226 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-06 22:41:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101687351] [2023-11-06 22:41:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101687351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:41:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481512751] [2023-11-06 22:41:30,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,228 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:30,229 INFO L87 Difference]: Start difference. First operand 754 states and 1106 transitions. cyclomatic complexity: 384 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,250 INFO L93 Difference]: Finished difference Result 1474 states and 2114 transitions. [2023-11-06 22:41:30,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1474 states and 2114 transitions. [2023-11-06 22:41:30,273 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2023-11-06 22:41:30,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1474 states to 1474 states and 2114 transitions. [2023-11-06 22:41:30,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2023-11-06 22:41:30,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1474 [2023-11-06 22:41:30,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1474 states and 2114 transitions. [2023-11-06 22:41:30,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:30,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2023-11-06 22:41:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states and 2114 transitions. [2023-11-06 22:41:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2023-11-06 22:41:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1474 states have (on average 1.4341926729986432) internal successors, (2114), 1473 states have internal predecessors, (2114), 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-06 22:41:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2114 transitions. [2023-11-06 22:41:30,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2023-11-06 22:41:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:30,329 INFO L428 stractBuchiCegarLoop]: Abstraction has 1474 states and 2114 transitions. [2023-11-06 22:41:30,330 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-06 22:41:30,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1474 states and 2114 transitions. [2023-11-06 22:41:30,340 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1472 [2023-11-06 22:41:30,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:30,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:30,341 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:30,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,341 INFO L748 eck$LassoCheckResult]: Stem: 4577#$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); 4547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 4548#L127-1 [2023-11-06 22:41:30,341 INFO L750 eck$LassoCheckResult]: Loop: 4548#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 4854#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 4851#L58 assume !(0 != main_~p1~0#1); 4852#L58-2 assume !(0 != main_~p2~0#1); 4823#L62-1 assume !(0 != main_~p3~0#1); 4824#L66-1 assume !(0 != main_~p4~0#1); 4897#L70-1 assume !(0 != main_~p5~0#1); 4895#L74-1 assume !(0 != main_~p6~0#1); 4891#L78-1 assume !(0 != main_~p7~0#1); 4885#L82-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4882#L86-1 assume !(0 != main_~p1~0#1); 4878#L92-1 assume !(0 != main_~p2~0#1); 4876#L97-1 assume !(0 != main_~p3~0#1); 4870#L102-1 assume !(0 != main_~p4~0#1); 4869#L107-1 assume !(0 != main_~p5~0#1); 4866#L112-1 assume !(0 != main_~p6~0#1); 4862#L117-1 assume !(0 != main_~p7~0#1); 4859#L122-1 assume !(0 != main_~p8~0#1); 4548#L127-1 [2023-11-06 22:41:30,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,342 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2023-11-06 22:41:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102510471] [2023-11-06 22:41:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,348 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:30,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1222837528, now seen corresponding path program 1 times [2023-11-06 22:41:30,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361873226] [2023-11-06 22:41:30,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:30,376 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-06 22:41:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:41:30,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361873226] [2023-11-06 22:41:30,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361873226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:41:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834101170] [2023-11-06 22:41:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,378 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-06 22:41:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:41:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:41:30,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:41:30,379 INFO L87 Difference]: Start difference. First operand 1474 states and 2114 transitions. cyclomatic complexity: 704 Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 22:41:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:41:30,406 INFO L93 Difference]: Finished difference Result 2882 states and 4034 transitions. [2023-11-06 22:41:30,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2882 states and 4034 transitions. [2023-11-06 22:41:30,432 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2023-11-06 22:41:30,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2882 states to 2882 states and 4034 transitions. [2023-11-06 22:41:30,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2882 [2023-11-06 22:41:30,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2882 [2023-11-06 22:41:30,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2882 states and 4034 transitions. [2023-11-06 22:41:30,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:30,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2023-11-06 22:41:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states and 4034 transitions. [2023-11-06 22:41:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2023-11-06 22:41:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2882 states have (on average 1.3997224149895906) internal successors, (4034), 2881 states have internal predecessors, (4034), 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-06 22:41:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 4034 transitions. [2023-11-06 22:41:30,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2023-11-06 22:41:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:41:30,530 INFO L428 stractBuchiCegarLoop]: Abstraction has 2882 states and 4034 transitions. [2023-11-06 22:41:30,530 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-06 22:41:30,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2882 states and 4034 transitions. [2023-11-06 22:41:30,548 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 2880 [2023-11-06 22:41:30,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-06 22:41:30,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-06 22:41:30,549 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-11-06 22:41:30,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,549 INFO L748 eck$LassoCheckResult]: Stem: 8945#$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); 8909#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~cond~0#1;havoc main_#t~nondet4#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;havoc main_#t~nondet5#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;havoc main_#t~nondet6#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;havoc main_#t~nondet7#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;havoc main_#t~nondet8#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;havoc main_#t~nondet9#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;havoc main_#t~nondet10#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;havoc main_#t~nondet11#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;havoc main_~cond~0#1; 8910#L127-1 [2023-11-06 22:41:30,549 INFO L750 eck$LassoCheckResult]: Loop: 8910#L127-1 assume !false;havoc main_#t~nondet12#1;main_~cond~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 9083#L37 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0; 9080#L58 assume !(0 != main_~p1~0#1); 9077#L58-2 assume !(0 != main_~p2~0#1); 9071#L62-1 assume !(0 != main_~p3~0#1); 9072#L66-1 assume !(0 != main_~p4~0#1); 9134#L70-1 assume !(0 != main_~p5~0#1); 9128#L74-1 assume !(0 != main_~p6~0#1); 9122#L78-1 assume !(0 != main_~p7~0#1); 9115#L82-1 assume !(0 != main_~p8~0#1); 9108#L86-1 assume !(0 != main_~p1~0#1); 9107#L92-1 assume !(0 != main_~p2~0#1); 9104#L97-1 assume !(0 != main_~p3~0#1); 9101#L102-1 assume !(0 != main_~p4~0#1); 9099#L107-1 assume !(0 != main_~p5~0#1); 9095#L112-1 assume !(0 != main_~p6~0#1); 9091#L117-1 assume !(0 != main_~p7~0#1); 9087#L122-1 assume !(0 != main_~p8~0#1); 8910#L127-1 [2023-11-06 22:41:30,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,550 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2023-11-06 22:41:30,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866046835] [2023-11-06 22:41:30,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:30,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,560 INFO L85 PathProgramCache]: Analyzing trace with hash -542779158, now seen corresponding path program 1 times [2023-11-06 22:41:30,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547216938] [2023-11-06 22:41:30,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:30,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1175900116, now seen corresponding path program 1 times [2023-11-06 22:41:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:41:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766868360] [2023-11-06 22:41:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:41:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:41:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:41:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:41:30,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.11 10:41:30 BoogieIcfgContainer [2023-11-06 22:41:30,982 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-11-06 22:41:30,982 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:41:30,982 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:41:30,983 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:41:30,983 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:41:28" (3/4) ... [2023-11-06 22:41:30,985 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-11-06 22:41:31,028 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:41:31,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:41:31,029 INFO L158 Benchmark]: Toolchain (without parser) took 2881.43ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 77.7MB in the beginning and 96.8MB in the end (delta: -19.1MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-06 22:41:31,029 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 123.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:31,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.49ms. Allocated memory is still 123.7MB. Free memory was 77.3MB in the beginning and 66.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:41:31,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.28ms. Allocated memory is still 123.7MB. Free memory was 66.4MB in the beginning and 64.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:31,031 INFO L158 Benchmark]: Boogie Preprocessor took 23.88ms. Allocated memory is still 123.7MB. Free memory was 64.7MB in the beginning and 63.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:31,031 INFO L158 Benchmark]: RCFGBuilder took 339.53ms. Allocated memory is still 123.7MB. Free memory was 63.4MB in the beginning and 52.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:41:31,032 INFO L158 Benchmark]: BuchiAutomizer took 2128.15ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 51.7MB in the beginning and 99.8MB in the end (delta: -48.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:41:31,032 INFO L158 Benchmark]: Witness Printer took 46.00ms. Allocated memory is still 159.4MB. Free memory was 98.9MB in the beginning and 96.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:41:31,034 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 123.7MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.49ms. Allocated memory is still 123.7MB. Free memory was 77.3MB in the beginning and 66.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.28ms. Allocated memory is still 123.7MB. Free memory was 66.4MB in the beginning and 64.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.88ms. Allocated memory is still 123.7MB. Free memory was 64.7MB in the beginning and 63.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 339.53ms. Allocated memory is still 123.7MB. Free memory was 63.4MB in the beginning and 52.1MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2128.15ms. Allocated memory was 123.7MB in the beginning and 159.4MB in the end (delta: 35.7MB). Free memory was 51.7MB in the beginning and 99.8MB in the end (delta: -48.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 46.00ms. Allocated memory is still 159.4MB. Free memory was 98.9MB in the beginning and 96.8MB 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 2882 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 7 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, 234 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 234 mSDsluCounter, 734 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 458 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI7 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: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L33] int cond; Loop: [L35] COND TRUE 1 [L36] cond = __VERIFIER_nondet_int() [L37] COND FALSE !(cond == 0) [L40] lk1 = 0 [L42] lk2 = 0 [L44] lk3 = 0 [L46] lk4 = 0 [L48] lk5 = 0 [L50] lk6 = 0 [L52] lk7 = 0 [L54] lk8 = 0 [L58] COND FALSE !(p1 != 0) [L62] COND FALSE !(p2 != 0) [L66] COND FALSE !(p3 != 0) [L70] COND FALSE !(p4 != 0) [L74] COND FALSE !(p5 != 0) [L78] COND FALSE !(p6 != 0) [L82] COND FALSE !(p7 != 0) [L86] COND FALSE !(p8 != 0) [L92] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L102] COND FALSE !(p3 != 0) [L107] COND FALSE !(p4 != 0) [L112] COND FALSE !(p5 != 0) [L117] COND FALSE !(p6 != 0) [L122] COND FALSE !(p7 != 0) [L127] COND FALSE !(p8 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-11-06 22:41:31,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11a77e84-f1b5-450c-9d6e-9bd01db15d71/bin/uautomizer-verify-WvqO1wxjHP/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)