./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:06:48,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:06:48,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:06:48,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:06:48,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:06:48,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:06:48,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:06:48,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:06:48,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:06:48,905 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:06:48,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:06:48,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:06:48,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:06:48,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:06:48,907 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:06:48,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:06:48,908 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:06:48,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:06:48,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:06:48,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:06:48,910 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:06:48,910 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:06:48,911 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:06:48,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:06:48,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:06:48,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:06:48,912 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:06:48,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:06:48,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:06:48,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:06:48,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:06:48,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:06:48,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:06:48,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:06:48,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:06:48,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:06:48,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:06:48,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:06:48,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:06:48,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:06:48,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:06:48,916 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/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_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 [2023-11-29 02:06:49,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:06:49,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:06:49,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:06:49,164 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:06:49,164 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:06:49,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-29 02:06:51,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:06:52,151 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:06:52,151 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-29 02:06:52,161 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/data/2293858ec/ef4e3278b7f64e1a99ed594fc77338ed/FLAG0abf15691 [2023-11-29 02:06:52,177 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/data/2293858ec/ef4e3278b7f64e1a99ed594fc77338ed [2023-11-29 02:06:52,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:06:52,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:06:52,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:06:52,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:06:52,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:06:52,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491fe4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52, skipping insertion in model container [2023-11-29 02:06:52,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,219 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:06:52,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:06:52,416 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:06:52,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:06:52,452 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:06:52,452 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:06:52,460 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:06:52,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52 WrapperNode [2023-11-29 02:06:52,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:06:52,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:06:52,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:06:52,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:06:52,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,507 INFO L138 Inliner]: procedures = 22, calls = 111, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 269 [2023-11-29 02:06:52,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:06:52,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:06:52,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:06:52,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:06:52,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,537 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 02:06:52,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,549 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:06:52,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:06:52,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:06:52,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:06:52,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (1/1) ... [2023-11-29 02:06:52,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:06:52,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:06:52,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:06:52,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d71f8274-7824-44a8-b7ef-c556daaea167/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:06:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:06:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 02:06:52,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 02:06:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 02:06:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 02:06:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 02:06:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 02:06:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:06:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:06:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:06:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:06:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:06:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:06:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:06:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:06:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:06:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:06:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:06:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:06:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:06:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:06:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:06:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 02:06:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 02:06:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:06:52,625 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:06:52,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:06:52,740 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:06:53,082 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:06:53,296 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:06:53,297 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:06:53,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:06:53 BoogieIcfgContainer [2023-11-29 02:06:53,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:06:53,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:06:53,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:06:53,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:06:53,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:06:52" (1/3) ... [2023-11-29 02:06:53,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cf8bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:06:53, skipping insertion in model container [2023-11-29 02:06:53,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:06:52" (2/3) ... [2023-11-29 02:06:53,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cf8bf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:06:53, skipping insertion in model container [2023-11-29 02:06:53,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:06:53" (3/3) ... [2023-11-29 02:06:53,305 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-11-29 02:06:53,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:06:53,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-29 02:06:53,319 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:06:53,366 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 02:06:53,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 80 transitions, 181 flow [2023-11-29 02:06:53,434 INFO L124 PetriNetUnfolderBase]: 0/77 cut-off events. [2023-11-29 02:06:53,434 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 02:06:53,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 77 events. 0/77 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 150 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2023-11-29 02:06:53,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 80 transitions, 181 flow [2023-11-29 02:06:53,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 76 transitions, 170 flow [2023-11-29 02:06:53,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:06:53,457 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75d4593a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:06:53,457 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-29 02:06:53,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:06:53,461 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:06:53,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:06:53,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:53,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:06:53,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:53,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 18505, now seen corresponding path program 1 times [2023-11-29 02:06:53,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:53,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310563032] [2023-11-29 02:06:53,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:06:53,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:53,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310563032] [2023-11-29 02:06:53,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310563032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:53,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:53,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:06:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970712105] [2023-11-29 02:06:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:53,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:06:53,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:06:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:06:53,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2023-11-29 02:06:53,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 02:06:53,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:53,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2023-11-29 02:06:53,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:54,614 INFO L124 PetriNetUnfolderBase]: 2574/4906 cut-off events. [2023-11-29 02:06:54,614 INFO L125 PetriNetUnfolderBase]: For 209/209 co-relation queries the response was YES. [2023-11-29 02:06:54,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8857 conditions, 4906 events. 2574/4906 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 35935 event pairs, 2574 based on Foata normal form. 1/4542 useless extension candidates. Maximal degree in co-relation 8265. Up to 3775 conditions per place. [2023-11-29 02:06:54,662 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 30 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2023-11-29 02:06:54,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 72 transitions, 224 flow [2023-11-29 02:06:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:06:54,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:06:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2023-11-29 02:06:54,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7041666666666667 [2023-11-29 02:06:54,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 169 transitions. [2023-11-29 02:06:54,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 169 transitions. [2023-11-29 02:06:54,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:54,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 169 transitions. [2023-11-29 02:06:54,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-29 02:06:54,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:54,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:54,689 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 170 flow. Second operand 3 states and 169 transitions. [2023-11-29 02:06:54,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 72 transitions, 224 flow [2023-11-29 02:06:54,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 72 transitions, 212 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 02:06:54,700 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 152 flow [2023-11-29 02:06:54,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2023-11-29 02:06:54,706 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -8 predicate places. [2023-11-29 02:06:54,706 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 152 flow [2023-11-29 02:06:54,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-29 02:06:54,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:54,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:06:54,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:06:54,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:54,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash 18506, now seen corresponding path program 1 times [2023-11-29 02:06:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958432685] [2023-11-29 02:06:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:54,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:54,840 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-29 02:06:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958432685] [2023-11-29 02:06:54,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958432685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:54,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:54,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:06:54,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833724767] [2023-11-29 02:06:54,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:54,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:06:54,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:06:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:06:54,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 80 [2023-11-29 02:06:54,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-29 02:06:54,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:54,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 80 [2023-11-29 02:06:54,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:55,242 INFO L124 PetriNetUnfolderBase]: 1692/3443 cut-off events. [2023-11-29 02:06:55,242 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 02:06:55,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 3443 events. 1692/3443 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 24599 event pairs, 1692 based on Foata normal form. 344/3479 useless extension candidates. Maximal degree in co-relation 6047. Up to 2549 conditions per place. [2023-11-29 02:06:55,270 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 28 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2023-11-29 02:06:55,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 70 transitions, 206 flow [2023-11-29 02:06:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:06:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:06:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2023-11-29 02:06:55,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2023-11-29 02:06:55,273 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 172 transitions. [2023-11-29 02:06:55,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 172 transitions. [2023-11-29 02:06:55,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:55,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 172 transitions. [2023-11-29 02:06:55,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:06:55,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:55,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:55,277 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 152 flow. Second operand 3 states and 172 transitions. [2023-11-29 02:06:55,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 70 transitions, 206 flow [2023-11-29 02:06:55,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 70 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:06:55,280 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 149 flow [2023-11-29 02:06:55,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-29 02:06:55,281 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2023-11-29 02:06:55,282 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 149 flow [2023-11-29 02:06:55,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-29 02:06:55,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:55,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:06:55,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:06:55,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:55,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash 551880983, now seen corresponding path program 1 times [2023-11-29 02:06:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:55,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473722109] [2023-11-29 02:06:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:55,350 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-29 02:06:55,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473722109] [2023-11-29 02:06:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473722109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:06:55,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673978563] [2023-11-29 02:06:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:55,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:06:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:55,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:06:55,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:06:55,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2023-11-29 02:06:55,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-29 02:06:55,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:55,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2023-11-29 02:06:55,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:55,848 INFO L124 PetriNetUnfolderBase]: 1782/3488 cut-off events. [2023-11-29 02:06:55,849 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-29 02:06:55,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6245 conditions, 3488 events. 1782/3488 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 24426 event pairs, 1782 based on Foata normal form. 0/3283 useless extension candidates. Maximal degree in co-relation 6238. Up to 2695 conditions per place. [2023-11-29 02:06:55,876 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 30 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2023-11-29 02:06:55,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 207 flow [2023-11-29 02:06:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:06:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:06:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2023-11-29 02:06:55,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-29 02:06:55,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 168 transitions. [2023-11-29 02:06:55,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 168 transitions. [2023-11-29 02:06:55,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:55,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 168 transitions. [2023-11-29 02:06:55,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-29 02:06:55,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:55,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:55,881 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 149 flow. Second operand 3 states and 168 transitions. [2023-11-29 02:06:55,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 207 flow [2023-11-29 02:06:55,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:06:55,884 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 146 flow [2023-11-29 02:06:55,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2023-11-29 02:06:55,885 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2023-11-29 02:06:55,885 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 146 flow [2023-11-29 02:06:55,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-29 02:06:55,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:55,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:06:55,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:06:55,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:55,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 551880984, now seen corresponding path program 1 times [2023-11-29 02:06:55,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:55,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917900212] [2023-11-29 02:06:55,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:55,975 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-29 02:06:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917900212] [2023-11-29 02:06:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917900212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:06:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703300794] [2023-11-29 02:06:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:55,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:06:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:06:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:06:56,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 80 [2023-11-29 02:06:56,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-29 02:06:56,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:56,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 80 [2023-11-29 02:06:56,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:56,394 INFO L124 PetriNetUnfolderBase]: 1692/3339 cut-off events. [2023-11-29 02:06:56,394 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 02:06:56,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 3339 events. 1692/3339 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 23345 event pairs, 1692 based on Foata normal form. 56/3191 useless extension candidates. Maximal degree in co-relation 5943. Up to 2549 conditions per place. [2023-11-29 02:06:56,418 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 28 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-11-29 02:06:56,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 66 transitions, 200 flow [2023-11-29 02:06:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:06:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:06:56,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2023-11-29 02:06:56,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2023-11-29 02:06:56,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 172 transitions. [2023-11-29 02:06:56,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 172 transitions. [2023-11-29 02:06:56,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:56,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 172 transitions. [2023-11-29 02:06:56,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:06:56,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:56,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:56,423 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 146 flow. Second operand 3 states and 172 transitions. [2023-11-29 02:06:56,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 66 transitions, 200 flow [2023-11-29 02:06:56,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 66 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:06:56,426 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 143 flow [2023-11-29 02:06:56,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2023-11-29 02:06:56,427 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2023-11-29 02:06:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 143 flow [2023-11-29 02:06:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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-29 02:06:56,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:56,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:06:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:06:56,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:56,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -47840841, now seen corresponding path program 1 times [2023-11-29 02:06:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425034410] [2023-11-29 02:06:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:56,476 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-29 02:06:56,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:56,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425034410] [2023-11-29 02:06:56,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425034410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:56,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:56,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:06:56,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281287853] [2023-11-29 02:06:56,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:56,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:06:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:06:56,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:06:56,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 80 [2023-11-29 02:06:56,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-29 02:06:56,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:56,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 80 [2023-11-29 02:06:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:56,924 INFO L124 PetriNetUnfolderBase]: 1782/3483 cut-off events. [2023-11-29 02:06:56,924 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 02:06:56,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6242 conditions, 3483 events. 1782/3483 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 24352 event pairs, 1782 based on Foata normal form. 0/3304 useless extension candidates. Maximal degree in co-relation 6233. Up to 2695 conditions per place. [2023-11-29 02:06:56,951 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 30 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-11-29 02:06:56,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 201 flow [2023-11-29 02:06:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:06:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:06:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2023-11-29 02:06:56,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2023-11-29 02:06:56,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 168 transitions. [2023-11-29 02:06:56,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 168 transitions. [2023-11-29 02:06:56,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:56,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 168 transitions. [2023-11-29 02:06:56,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-29 02:06:56,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:56,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:56,956 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 143 flow. Second operand 3 states and 168 transitions. [2023-11-29 02:06:56,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 201 flow [2023-11-29 02:06:56,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:06:56,958 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 140 flow [2023-11-29 02:06:56,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2023-11-29 02:06:56,959 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2023-11-29 02:06:56,960 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 140 flow [2023-11-29 02:06:56,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-29 02:06:56,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:56,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:06:56,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:06:56,961 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:56,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:56,961 INFO L85 PathProgramCache]: Analyzing trace with hash -47840840, now seen corresponding path program 1 times [2023-11-29 02:06:56,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:56,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130506130] [2023-11-29 02:06:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:56,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:57,041 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-29 02:06:57,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:57,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130506130] [2023-11-29 02:06:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130506130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:57,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:57,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:06:57,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281424357] [2023-11-29 02:06:57,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:57,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:06:57,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:57,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:06:57,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:06:57,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 80 [2023-11-29 02:06:57,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-29 02:06:57,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:57,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 80 [2023-11-29 02:06:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:57,380 INFO L124 PetriNetUnfolderBase]: 1692/3307 cut-off events. [2023-11-29 02:06:57,381 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-29 02:06:57,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 3307 events. 1692/3307 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 23096 event pairs, 1692 based on Foata normal form. 56/3191 useless extension candidates. Maximal degree in co-relation 5911. Up to 2549 conditions per place. [2023-11-29 02:06:57,432 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 28 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-11-29 02:06:57,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 62 transitions, 194 flow [2023-11-29 02:06:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:06:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:06:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2023-11-29 02:06:57,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2023-11-29 02:06:57,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 172 transitions. [2023-11-29 02:06:57,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 172 transitions. [2023-11-29 02:06:57,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:57,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 172 transitions. [2023-11-29 02:06:57,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:06:57,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:57,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:06:57,436 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 140 flow. Second operand 3 states and 172 transitions. [2023-11-29 02:06:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 62 transitions, 194 flow [2023-11-29 02:06:57,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 62 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:06:57,438 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 137 flow [2023-11-29 02:06:57,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2023-11-29 02:06:57,439 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, -13 predicate places. [2023-11-29 02:06:57,439 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 137 flow [2023-11-29 02:06:57,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-29 02:06:57,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:57,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:06:57,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:06:57,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:57,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1654810382, now seen corresponding path program 1 times [2023-11-29 02:06:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870569096] [2023-11-29 02:06:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:57,751 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-29 02:06:57,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:57,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870569096] [2023-11-29 02:06:57,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870569096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:57,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:57,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:06:57,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254173222] [2023-11-29 02:06:57,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:57,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:06:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:06:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:06:57,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2023-11-29 02:06:57,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 137 flow. Second operand has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:06:57,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:57,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2023-11-29 02:06:57,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:06:59,017 INFO L124 PetriNetUnfolderBase]: 4543/7983 cut-off events. [2023-11-29 02:06:59,017 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2023-11-29 02:06:59,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15025 conditions, 7983 events. 4543/7983 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 57563 event pairs, 1545 based on Foata normal form. 1/7895 useless extension candidates. Maximal degree in co-relation 15014. Up to 2042 conditions per place. [2023-11-29 02:06:59,075 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 146 selfloop transitions, 15 changer transitions 21/209 dead transitions. [2023-11-29 02:06:59,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 209 transitions, 821 flow [2023-11-29 02:06:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:06:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:06:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 656 transitions. [2023-11-29 02:06:59,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7454545454545455 [2023-11-29 02:06:59,079 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 656 transitions. [2023-11-29 02:06:59,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 656 transitions. [2023-11-29 02:06:59,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:06:59,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 656 transitions. [2023-11-29 02:06:59,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 59.63636363636363) internal successors, (656), 11 states have internal predecessors, (656), 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-29 02:06:59,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:06:59,086 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:06:59,086 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 137 flow. Second operand 11 states and 656 transitions. [2023-11-29 02:06:59,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 209 transitions, 821 flow [2023-11-29 02:06:59,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 209 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:06:59,092 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 228 flow [2023-11-29 02:06:59,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=228, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2023-11-29 02:06:59,093 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 0 predicate places. [2023-11-29 02:06:59,093 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 228 flow [2023-11-29 02:06:59,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:06:59,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:06:59,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:06:59,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:06:59,094 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:06:59,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash 627069332, now seen corresponding path program 2 times [2023-11-29 02:06:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:06:59,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323650210] [2023-11-29 02:06:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:06:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:06:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:06:59,763 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-29 02:06:59,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:06:59,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323650210] [2023-11-29 02:06:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323650210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:06:59,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:06:59,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:06:59,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087048788] [2023-11-29 02:06:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:06:59,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:06:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:06:59,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:06:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:06:59,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2023-11-29 02:06:59,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 47.5) internal successors, (380), 8 states have internal predecessors, (380), 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-29 02:06:59,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:06:59,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2023-11-29 02:06:59,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:00,970 INFO L124 PetriNetUnfolderBase]: 7153/12766 cut-off events. [2023-11-29 02:07:00,971 INFO L125 PetriNetUnfolderBase]: For 186/188 co-relation queries the response was YES. [2023-11-29 02:07:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24961 conditions, 12766 events. 7153/12766 cut-off events. For 186/188 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 96486 event pairs, 2487 based on Foata normal form. 104/12560 useless extension candidates. Maximal degree in co-relation 24945. Up to 7814 conditions per place. [2023-11-29 02:07:01,062 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 111 selfloop transitions, 22 changer transitions 0/176 dead transitions. [2023-11-29 02:07:01,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 176 transitions, 696 flow [2023-11-29 02:07:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:07:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:07:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 478 transitions. [2023-11-29 02:07:01,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746875 [2023-11-29 02:07:01,065 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 478 transitions. [2023-11-29 02:07:01,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 478 transitions. [2023-11-29 02:07:01,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:01,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 478 transitions. [2023-11-29 02:07:01,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 59.75) internal successors, (478), 8 states have internal predecessors, (478), 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-29 02:07:01,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 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-29 02:07:01,069 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 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-29 02:07:01,069 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 228 flow. Second operand 8 states and 478 transitions. [2023-11-29 02:07:01,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 176 transitions, 696 flow [2023-11-29 02:07:01,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 176 transitions, 694 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 02:07:01,091 INFO L231 Difference]: Finished difference. Result has 95 places, 100 transitions, 368 flow [2023-11-29 02:07:01,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=368, PETRI_PLACES=95, PETRI_TRANSITIONS=100} [2023-11-29 02:07:01,092 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 9 predicate places. [2023-11-29 02:07:01,092 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 100 transitions, 368 flow [2023-11-29 02:07:01,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 47.5) internal successors, (380), 8 states have internal predecessors, (380), 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-29 02:07:01,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:01,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:01,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:07:01,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:01,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1001461450, now seen corresponding path program 3 times [2023-11-29 02:07:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:01,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743190422] [2023-11-29 02:07:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:01,206 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-29 02:07:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:01,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743190422] [2023-11-29 02:07:01,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743190422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:07:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227403385] [2023-11-29 02:07:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:01,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:07:01,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:07:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:07:01,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 80 [2023-11-29 02:07:01,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 100 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:07:01,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:01,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 80 [2023-11-29 02:07:01,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:02,038 INFO L124 PetriNetUnfolderBase]: 4517/9147 cut-off events. [2023-11-29 02:07:02,038 INFO L125 PetriNetUnfolderBase]: For 1691/1722 co-relation queries the response was YES. [2023-11-29 02:07:02,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19570 conditions, 9147 events. 4517/9147 cut-off events. For 1691/1722 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 74718 event pairs, 2684 based on Foata normal form. 165/8997 useless extension candidates. Maximal degree in co-relation 19548. Up to 5261 conditions per place. [2023-11-29 02:07:02,109 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 59 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-11-29 02:07:02,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 118 transitions, 547 flow [2023-11-29 02:07:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:07:02,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:07:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2023-11-29 02:07:02,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7833333333333333 [2023-11-29 02:07:02,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 188 transitions. [2023-11-29 02:07:02,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 188 transitions. [2023-11-29 02:07:02,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:02,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 188 transitions. [2023-11-29 02:07:02,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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-29 02:07:02,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:07:02,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:07:02,114 INFO L175 Difference]: Start difference. First operand has 95 places, 100 transitions, 368 flow. Second operand 3 states and 188 transitions. [2023-11-29 02:07:02,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 118 transitions, 547 flow [2023-11-29 02:07:02,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 118 transitions, 547 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:07:02,153 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 378 flow [2023-11-29 02:07:02,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2023-11-29 02:07:02,154 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 12 predicate places. [2023-11-29 02:07:02,154 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 378 flow [2023-11-29 02:07:02,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:07:02,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:02,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:02,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:07:02,155 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:02,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash 9915972, now seen corresponding path program 4 times [2023-11-29 02:07:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111990234] [2023-11-29 02:07:02,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:02,283 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-29 02:07:02,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:02,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111990234] [2023-11-29 02:07:02,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111990234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:02,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:02,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:07:02,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372579223] [2023-11-29 02:07:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:02,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:07:02,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:02,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:07:02,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:07:02,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 80 [2023-11-29 02:07:02,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:07:02,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:02,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 80 [2023-11-29 02:07:02,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:02,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][64], [Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 170#(= ~e3~0 1), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 37#L190-4true, 59#L79true, 145#true, Black: 165#(= ~e2~0 1), 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), 40#L103true, 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 85#L139true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 163#true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-29 02:07:02,776 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 02:07:02,776 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 02:07:02,776 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 02:07:02,776 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 02:07:02,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([625] L136-->L139: Formula: (= v_~n3~0_33 (+ v_~n3~0_34 1)) InVars {~n3~0=v_~n3~0_34} OutVars{thread3Thread1of1ForFork1_#t~post3#1=|v_thread3Thread1of1ForFork1_#t~post3#1_1|, ~n3~0=v_~n3~0_33} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post3#1, ~n3~0][64], [Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 170#(= ~e3~0 1), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 59#L79true, Black: 165#(= ~e2~0 1), 16#L191true, 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 40#L103true, 85#L139true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 129#(and (= ~i1~0 0) (= ~i~0 1)), 163#true, Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2023-11-29 02:07:02,801 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-29 02:07:02,801 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 02:07:02,801 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 02:07:02,801 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-29 02:07:03,162 INFO L124 PetriNetUnfolderBase]: 4641/9489 cut-off events. [2023-11-29 02:07:03,162 INFO L125 PetriNetUnfolderBase]: For 2173/2251 co-relation queries the response was YES. [2023-11-29 02:07:03,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21009 conditions, 9489 events. 4641/9489 cut-off events. For 2173/2251 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 78732 event pairs, 3000 based on Foata normal form. 159/9290 useless extension candidates. Maximal degree in co-relation 20985. Up to 5418 conditions per place. [2023-11-29 02:07:03,213 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 60 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2023-11-29 02:07:03,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 119 transitions, 572 flow [2023-11-29 02:07:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:07:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:07:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2023-11-29 02:07:03,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7791666666666667 [2023-11-29 02:07:03,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 187 transitions. [2023-11-29 02:07:03,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 187 transitions. [2023-11-29 02:07:03,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:03,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 187 transitions. [2023-11-29 02:07:03,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-29 02:07:03,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:07:03,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:07:03,217 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 378 flow. Second operand 3 states and 187 transitions. [2023-11-29 02:07:03,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 119 transitions, 572 flow [2023-11-29 02:07:03,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 119 transitions, 568 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:07:03,253 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 384 flow [2023-11-29 02:07:03,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2023-11-29 02:07:03,254 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 13 predicate places. [2023-11-29 02:07:03,254 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 384 flow [2023-11-29 02:07:03,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:07:03,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:03,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:03,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:07:03,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:03,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:03,256 INFO L85 PathProgramCache]: Analyzing trace with hash -886507396, now seen corresponding path program 5 times [2023-11-29 02:07:03,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:03,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335280528] [2023-11-29 02:07:03,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:03,832 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-29 02:07:03,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:03,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335280528] [2023-11-29 02:07:03,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335280528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:03,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:03,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:07:03,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481271826] [2023-11-29 02:07:03,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:03,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:07:03,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:03,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:07:03,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:07:03,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 80 [2023-11-29 02:07:03,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 384 flow. Second operand has 9 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 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-29 02:07:03,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:03,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 80 [2023-11-29 02:07:03,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:05,603 INFO L124 PetriNetUnfolderBase]: 10187/18037 cut-off events. [2023-11-29 02:07:05,604 INFO L125 PetriNetUnfolderBase]: For 5782/5848 co-relation queries the response was YES. [2023-11-29 02:07:05,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42981 conditions, 18037 events. 10187/18037 cut-off events. For 5782/5848 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 138496 event pairs, 4173 based on Foata normal form. 134/17684 useless extension candidates. Maximal degree in co-relation 42956. Up to 11044 conditions per place. [2023-11-29 02:07:05,706 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 123 selfloop transitions, 42 changer transitions 0/205 dead transitions. [2023-11-29 02:07:05,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 205 transitions, 1039 flow [2023-11-29 02:07:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:07:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 02:07:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 552 transitions. [2023-11-29 02:07:05,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.69 [2023-11-29 02:07:05,709 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 552 transitions. [2023-11-29 02:07:05,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 552 transitions. [2023-11-29 02:07:05,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:05,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 552 transitions. [2023-11-29 02:07:05,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 55.2) internal successors, (552), 10 states have internal predecessors, (552), 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-29 02:07:05,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-29 02:07:05,714 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 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-29 02:07:05,714 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 384 flow. Second operand 10 states and 552 transitions. [2023-11-29 02:07:05,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 205 transitions, 1039 flow [2023-11-29 02:07:05,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 205 transitions, 1035 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:07:05,774 INFO L231 Difference]: Finished difference. Result has 111 places, 121 transitions, 622 flow [2023-11-29 02:07:05,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=622, PETRI_PLACES=111, PETRI_TRANSITIONS=121} [2023-11-29 02:07:05,775 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 25 predicate places. [2023-11-29 02:07:05,775 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 121 transitions, 622 flow [2023-11-29 02:07:05,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 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-29 02:07:05,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:05,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:05,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:07:05,776 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:05,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:05,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1797541330, now seen corresponding path program 6 times [2023-11-29 02:07:05,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:05,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032162881] [2023-11-29 02:07:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:05,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:06,192 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-29 02:07:06,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032162881] [2023-11-29 02:07:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032162881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:06,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:07:06,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431752973] [2023-11-29 02:07:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:06,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:07:06,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:06,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:07:06,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:07:06,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 80 [2023-11-29 02:07:06,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 121 transitions, 622 flow. Second operand has 10 states, 10 states have (on average 43.8) internal successors, (438), 10 states have internal predecessors, (438), 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-29 02:07:06,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:06,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 80 [2023-11-29 02:07:06,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:09,112 INFO L124 PetriNetUnfolderBase]: 14891/25723 cut-off events. [2023-11-29 02:07:09,112 INFO L125 PetriNetUnfolderBase]: For 18943/19099 co-relation queries the response was YES. [2023-11-29 02:07:09,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68567 conditions, 25723 events. 14891/25723 cut-off events. For 18943/19099 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 204694 event pairs, 4780 based on Foata normal form. 247/25258 useless extension candidates. Maximal degree in co-relation 68536. Up to 12163 conditions per place. [2023-11-29 02:07:09,299 INFO L140 encePairwiseOnDemand]: 68/80 looper letters, 201 selfloop transitions, 77 changer transitions 0/318 dead transitions. [2023-11-29 02:07:09,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 318 transitions, 1990 flow [2023-11-29 02:07:09,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:07:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 02:07:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 787 transitions. [2023-11-29 02:07:09,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7026785714285714 [2023-11-29 02:07:09,302 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 787 transitions. [2023-11-29 02:07:09,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 787 transitions. [2023-11-29 02:07:09,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:09,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 787 transitions. [2023-11-29 02:07:09,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 56.214285714285715) internal successors, (787), 14 states have internal predecessors, (787), 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-29 02:07:09,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-29 02:07:09,308 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-29 02:07:09,308 INFO L175 Difference]: Start difference. First operand has 111 places, 121 transitions, 622 flow. Second operand 14 states and 787 transitions. [2023-11-29 02:07:09,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 318 transitions, 1990 flow [2023-11-29 02:07:09,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 318 transitions, 1977 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-29 02:07:09,630 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 1298 flow [2023-11-29 02:07:09,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1298, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2023-11-29 02:07:09,631 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 47 predicate places. [2023-11-29 02:07:09,631 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 1298 flow [2023-11-29 02:07:09,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 43.8) internal successors, (438), 10 states have internal predecessors, (438), 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-29 02:07:09,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:09,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:09,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:07:09,632 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:09,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1890330774, now seen corresponding path program 7 times [2023-11-29 02:07:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936480088] [2023-11-29 02:07:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:09,900 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-29 02:07:09,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:09,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936480088] [2023-11-29 02:07:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936480088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:09,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:09,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:07:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154741076] [2023-11-29 02:07:09,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:09,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:07:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:09,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:07:09,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:07:09,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2023-11-29 02:07:09,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 1298 flow. Second operand has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:07:09,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:09,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2023-11-29 02:07:09,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:13,479 INFO L124 PetriNetUnfolderBase]: 15724/26797 cut-off events. [2023-11-29 02:07:13,479 INFO L125 PetriNetUnfolderBase]: For 38002/38798 co-relation queries the response was YES. [2023-11-29 02:07:13,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80290 conditions, 26797 events. 15724/26797 cut-off events. For 38002/38798 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 216871 event pairs, 5346 based on Foata normal form. 275/26362 useless extension candidates. Maximal degree in co-relation 80247. Up to 7458 conditions per place. [2023-11-29 02:07:13,688 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 264 selfloop transitions, 23 changer transitions 7/380 dead transitions. [2023-11-29 02:07:13,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 380 transitions, 3068 flow [2023-11-29 02:07:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:07:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:07:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 652 transitions. [2023-11-29 02:07:13,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.740909090909091 [2023-11-29 02:07:13,691 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 652 transitions. [2023-11-29 02:07:13,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 652 transitions. [2023-11-29 02:07:13,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:13,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 652 transitions. [2023-11-29 02:07:13,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 59.27272727272727) internal successors, (652), 11 states have internal predecessors, (652), 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-29 02:07:13,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:07:13,697 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:07:13,697 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 1298 flow. Second operand 11 states and 652 transitions. [2023-11-29 02:07:13,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 380 transitions, 3068 flow [2023-11-29 02:07:14,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 380 transitions, 2968 flow, removed 50 selfloop flow, removed 0 redundant places. [2023-11-29 02:07:14,055 INFO L231 Difference]: Finished difference. Result has 147 places, 190 transitions, 1374 flow [2023-11-29 02:07:14,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1374, PETRI_PLACES=147, PETRI_TRANSITIONS=190} [2023-11-29 02:07:14,055 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 61 predicate places. [2023-11-29 02:07:14,056 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 190 transitions, 1374 flow [2023-11-29 02:07:14,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:07:14,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:14,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:14,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:07:14,056 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:14,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -105875106, now seen corresponding path program 8 times [2023-11-29 02:07:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303265018] [2023-11-29 02:07:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:14,889 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-29 02:07:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303265018] [2023-11-29 02:07:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303265018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:14,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:14,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:07:14,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115300494] [2023-11-29 02:07:14,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:14,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:07:14,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:14,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:07:14,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:07:14,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 80 [2023-11-29 02:07:14,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 190 transitions, 1374 flow. Second operand has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 13 states have internal predecessors, (558), 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-29 02:07:14,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:14,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 80 [2023-11-29 02:07:14,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:20,457 INFO L124 PetriNetUnfolderBase]: 24838/43806 cut-off events. [2023-11-29 02:07:20,457 INFO L125 PetriNetUnfolderBase]: For 77626/78640 co-relation queries the response was YES. [2023-11-29 02:07:20,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140390 conditions, 43806 events. 24838/43806 cut-off events. For 77626/78640 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 387220 event pairs, 5990 based on Foata normal form. 383/43045 useless extension candidates. Maximal degree in co-relation 140341. Up to 11714 conditions per place. [2023-11-29 02:07:20,979 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 204 selfloop transitions, 156 changer transitions 0/411 dead transitions. [2023-11-29 02:07:20,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 411 transitions, 3594 flow [2023-11-29 02:07:20,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:07:20,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:07:20,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 471 transitions. [2023-11-29 02:07:20,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7359375 [2023-11-29 02:07:20,981 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 471 transitions. [2023-11-29 02:07:20,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 471 transitions. [2023-11-29 02:07:20,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:20,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 471 transitions. [2023-11-29 02:07:20,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 58.875) internal successors, (471), 8 states have internal predecessors, (471), 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-29 02:07:20,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 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-29 02:07:20,986 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 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-29 02:07:20,986 INFO L175 Difference]: Start difference. First operand has 147 places, 190 transitions, 1374 flow. Second operand 8 states and 471 transitions. [2023-11-29 02:07:20,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 411 transitions, 3594 flow [2023-11-29 02:07:21,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 411 transitions, 3577 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 02:07:21,964 INFO L231 Difference]: Finished difference. Result has 156 places, 302 transitions, 2950 flow [2023-11-29 02:07:21,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2950, PETRI_PLACES=156, PETRI_TRANSITIONS=302} [2023-11-29 02:07:21,966 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 70 predicate places. [2023-11-29 02:07:21,966 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 302 transitions, 2950 flow [2023-11-29 02:07:21,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 13 states have internal predecessors, (558), 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-29 02:07:21,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:21,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:21,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:07:21,967 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:21,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1088067802, now seen corresponding path program 9 times [2023-11-29 02:07:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:21,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106517869] [2023-11-29 02:07:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:22,523 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-29 02:07:22,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:22,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106517869] [2023-11-29 02:07:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106517869] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:07:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402879277] [2023-11-29 02:07:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:22,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:07:22,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:07:22,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:07:22,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 80 [2023-11-29 02:07:22,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 302 transitions, 2950 flow. Second operand has 9 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 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-29 02:07:22,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:22,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 80 [2023-11-29 02:07:22,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:32,687 INFO L124 PetriNetUnfolderBase]: 40237/70637 cut-off events. [2023-11-29 02:07:32,688 INFO L125 PetriNetUnfolderBase]: For 228622/231621 co-relation queries the response was YES. [2023-11-29 02:07:33,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267560 conditions, 70637 events. 40237/70637 cut-off events. For 228622/231621 co-relation queries the response was YES. Maximal size of possible extension queue 2485. Compared 664117 event pairs, 11774 based on Foata normal form. 772/69451 useless extension candidates. Maximal degree in co-relation 267506. Up to 34459 conditions per place. [2023-11-29 02:07:33,684 INFO L140 encePairwiseOnDemand]: 66/80 looper letters, 422 selfloop transitions, 104 changer transitions 12/589 dead transitions. [2023-11-29 02:07:33,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 589 transitions, 6086 flow [2023-11-29 02:07:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:07:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 02:07:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 760 transitions. [2023-11-29 02:07:33,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2023-11-29 02:07:33,687 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 760 transitions. [2023-11-29 02:07:33,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 760 transitions. [2023-11-29 02:07:33,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:33,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 760 transitions. [2023-11-29 02:07:33,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 58.46153846153846) internal successors, (760), 13 states have internal predecessors, (760), 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-29 02:07:33,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 80.0) internal successors, (1120), 14 states have internal predecessors, (1120), 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-29 02:07:33,692 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 80.0) internal successors, (1120), 14 states have internal predecessors, (1120), 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-29 02:07:33,692 INFO L175 Difference]: Start difference. First operand has 156 places, 302 transitions, 2950 flow. Second operand 13 states and 760 transitions. [2023-11-29 02:07:33,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 589 transitions, 6086 flow [2023-11-29 02:07:37,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 589 transitions, 5910 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-29 02:07:37,008 INFO L231 Difference]: Finished difference. Result has 176 places, 380 transitions, 3927 flow [2023-11-29 02:07:37,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3927, PETRI_PLACES=176, PETRI_TRANSITIONS=380} [2023-11-29 02:07:37,009 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 90 predicate places. [2023-11-29 02:07:37,009 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 380 transitions, 3927 flow [2023-11-29 02:07:37,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 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-29 02:07:37,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:37,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:37,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:07:37,010 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:37,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 494946552, now seen corresponding path program 10 times [2023-11-29 02:07:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:37,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226812080] [2023-11-29 02:07:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:37,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:37,081 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-29 02:07:37,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:37,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226812080] [2023-11-29 02:07:37,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226812080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:37,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:37,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:07:37,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399903568] [2023-11-29 02:07:37,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:37,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:07:37,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:37,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:07:37,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:07:37,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 80 [2023-11-29 02:07:37,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 380 transitions, 3927 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:07:37,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:37,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 80 [2023-11-29 02:07:37,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:07:41,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), 68#L149true, Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:41,624 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,624 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,624 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,624 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 173#true, Black: 170#(= ~e3~0 1), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 4#L106true, Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), 68#L149true, Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 59#L79true, Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:41,625 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,625 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,625 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,625 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-29 02:07:41,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 16#L191true, Black: 165#(= ~e2~0 1), Black: 170#(= ~e3~0 1), 173#true, Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 68#L149true, Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 310#true, 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:41,898 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,898 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,898 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,898 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 16#L191true, Black: 165#(= ~e2~0 1), 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 4#L106true, Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 68#L149true, Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), 59#L79true, Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:41,899 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,899 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,899 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:41,899 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 26#L152true, 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 310#true, 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,059 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 26#L152true, 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 173#true, Black: 170#(= ~e3~0 1), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 4#L106true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 59#L79true, Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,059 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,059 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-29 02:07:42,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 26#L152true, 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 16#L191true, Black: 170#(= ~e3~0 1), 173#true, Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 310#true, 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,349 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,349 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,349 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,350 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 26#L152true, 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 16#L191true, Black: 165#(= ~e2~0 1), 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 4#L106true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), 59#L79true, Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,350 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,350 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,350 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,351 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 53#L155true, 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 310#true, 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,526 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,526 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,526 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,526 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 53#L155true, Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 173#true, Black: 170#(= ~e3~0 1), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 4#L106true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 59#L79true, Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,526 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,526 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,527 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,527 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-29 02:07:42,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 16#L191true, 53#L155true, Black: 170#(= ~e3~0 1), 173#true, Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,929 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 16#L191true, Black: 165#(= ~e2~0 1), 53#L155true, 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 4#L106true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), 59#L79true, Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:42,929 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 02:07:42,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-29 02:07:44,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 173#true, Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 27#thread3EXITtrue, Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 120#(= ~i1~0 0), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:44,303 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-29 02:07:44,303 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 02:07:44,303 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 02:07:44,303 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-29 02:07:44,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([606] L79-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_1| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_1|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#res#1.base][68], [Black: 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), 16#L191true, Black: 170#(= ~e3~0 1), 173#true, Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 40#L103true, Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 27#thread3EXITtrue, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), 12#thread1EXITtrue, Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 120#(= ~i1~0 0), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:44,495 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-29 02:07:44,495 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-29 02:07:44,495 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-29 02:07:44,495 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-29 02:07:44,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 165#(= ~e2~0 1), Black: 170#(= ~e3~0 1), Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 173#true, Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 27#thread3EXITtrue, 4#L106true, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 120#(= ~i1~0 0), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 37#L190-4true, Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), 59#L79true, Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:44,549 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is not cut-off event [2023-11-29 02:07:44,549 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-11-29 02:07:44,549 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-11-29 02:07:44,549 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is not cut-off event [2023-11-29 02:07:44,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L103-->L106: Formula: (not (= (ite (not (and (or (= v_~n1~0_139 v_~n2~0_121) (< v_~n1~0_139 v_~n2~0_121)) (not (= v_~n1~0_139 0)))) 1 0) 0)) InVars {~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_3|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_3|, ~n2~0=v_~n2~0_121, ~n1~0=v_~n1~0_139} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][109], [Black: 243#(and (= ~i1~0 0) (= ~i~0 1)), Black: 249#(and (= ~i1~0 0) (= ~i3~0 1)), Black: 133#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i2~0 1)), Black: 129#(and (= ~i1~0 0) (= ~i~0 1)), Black: 119#(= ~i~0 0), Black: 266#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1)))), Black: 275#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 263#(and (<= 1 ~n1~0) (<= 0 ~n3~0)), Black: 273#(and (<= 1 ~n1~0) (<= ~n2~0 ~n3~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (not (= ~n2~0 ~n3~0))), Black: 264#(and (<= 1 ~n1~0) (or (= ~n2~0 0) (< ~n1~0 (+ ~n2~0 1))) (<= 0 ~n3~0)), Black: 147#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n3~0 ~n1~0)), Black: 148#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 149#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 99#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 16#L191true, Black: 165#(= ~e2~0 1), 173#true, Black: 289#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), Black: 170#(= ~e3~0 1), Black: 288#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (= ~n1~0 0)), Black: 298#(and (<= 1 ~n2~0) (= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 292#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0) (<= ~n1~0 ~n2~0)), Black: 294#(and (= ~n2~0 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 286#(and (<= ~n3~0 ~n2~0) (<= 0 ~n3~0)), 27#thread3EXITtrue, Black: 296#(and (= ~n2~0 ~n1~0) (<= 1 ~n2~0) (= ~n2~0 ~n3~0)), 4#L106true, Black: 290#(and (<= (+ ~n2~0 1) ~n3~0) (<= 1 ~n2~0)), Black: 287#(and (<= (+ ~n3~0 1) ~n2~0) (<= 0 ~n3~0)), Black: 177#(and (<= 1 ~n1~0) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 185#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 181#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 175#(and (<= 0 ~n1~0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 111#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 187#(and (<= 1 ~n1~0) (<= (+ 2 ~n3~0) (+ ~n2~0 ~n1~0)) (<= ~n1~0 ~n2~0) (= ~n1~0 ~n3~0)), 247#(and (= 2 ~i~0) (= ~i1~0 0) (= ~i3~0 1)), 145#true, 107#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 95#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 194#true, 103#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 211#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= ~n1~0 ~n3~0)), Black: 205#(and (<= 1 ~n1~0) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 (+ ~n2~0 1))) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 213#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1)))), Black: 198#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 120#(= ~i1~0 0), Black: 207#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 215#(and (<= 1 ~n1~0) (<= ~n1~0 ~n3~0) (<= 2 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 196#(and (<= 0 ~n3~0) (= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 219#(and (<= 1 ~n1~0) (or (= ~n2~0 ~n1~0) (< 1 ~n3~0)) (<= ~n1~0 ~n3~0) (<= ~n2~0 ~n1~0)), Black: 209#(and (<= 1 ~n1~0) (or (< 1 ~n3~0) (< ~n1~0 (+ ~n2~0 1))) (or (< ~n1~0 (+ ~n3~0 1)) (< ~n1~0 ~n2~0))), 59#L79true, Black: 197#(and (<= 0 ~n1~0) (<= ~n2~0 ~n1~0)), 115#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 310#true, Black: 253#(and (= ~i1~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0))]) [2023-11-29 02:07:44,739 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is not cut-off event [2023-11-29 02:07:44,740 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-11-29 02:07:44,740 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-11-29 02:07:44,740 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is not cut-off event [2023-11-29 02:07:45,848 INFO L124 PetriNetUnfolderBase]: 28325/56469 cut-off events. [2023-11-29 02:07:45,848 INFO L125 PetriNetUnfolderBase]: For 185565/188613 co-relation queries the response was YES. [2023-11-29 02:07:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204989 conditions, 56469 events. 28325/56469 cut-off events. For 185565/188613 co-relation queries the response was YES. Maximal size of possible extension queue 2223. Compared 597181 event pairs, 16889 based on Foata normal form. 1357/55436 useless extension candidates. Maximal degree in co-relation 204925. Up to 31690 conditions per place. [2023-11-29 02:07:46,802 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 205 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2023-11-29 02:07:46,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 435 transitions, 4949 flow [2023-11-29 02:07:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:07:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:07:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2023-11-29 02:07:46,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7875 [2023-11-29 02:07:46,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 189 transitions. [2023-11-29 02:07:46,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 189 transitions. [2023-11-29 02:07:46,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:07:46,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 189 transitions. [2023-11-29 02:07:46,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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-29 02:07:46,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:07:46,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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-29 02:07:46,806 INFO L175 Difference]: Start difference. First operand has 176 places, 380 transitions, 3927 flow. Second operand 3 states and 189 transitions. [2023-11-29 02:07:46,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 435 transitions, 4949 flow [2023-11-29 02:07:49,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 435 transitions, 4825 flow, removed 59 selfloop flow, removed 1 redundant places. [2023-11-29 02:07:49,516 INFO L231 Difference]: Finished difference. Result has 178 places, 374 transitions, 3781 flow [2023-11-29 02:07:49,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=3771, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3781, PETRI_PLACES=178, PETRI_TRANSITIONS=374} [2023-11-29 02:07:49,517 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 92 predicate places. [2023-11-29 02:07:49,517 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 374 transitions, 3781 flow [2023-11-29 02:07:49,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-29 02:07:49,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:07:49,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:07:49,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:07:49,518 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:07:49,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1918623862, now seen corresponding path program 11 times [2023-11-29 02:07:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:07:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680815031] [2023-11-29 02:07:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:07:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:49,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-29 02:07:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:07:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680815031] [2023-11-29 02:07:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680815031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:07:49,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:07:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:07:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685944137] [2023-11-29 02:07:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:07:49,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:07:49,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:07:49,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:07:49,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:07:49,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 80 [2023-11-29 02:07:49,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 374 transitions, 3781 flow. Second operand has 8 states, 8 states have (on average 46.5) internal successors, (372), 8 states have internal predecessors, (372), 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-29 02:07:49,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:07:49,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 80 [2023-11-29 02:07:49,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:08:01,783 INFO L124 PetriNetUnfolderBase]: 43141/75754 cut-off events. [2023-11-29 02:08:01,783 INFO L125 PetriNetUnfolderBase]: For 339381/343444 co-relation queries the response was YES. [2023-11-29 02:08:02,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309542 conditions, 75754 events. 43141/75754 cut-off events. For 339381/343444 co-relation queries the response was YES. Maximal size of possible extension queue 2665. Compared 719043 event pairs, 11352 based on Foata normal form. 1388/74734 useless extension candidates. Maximal degree in co-relation 309477. Up to 22599 conditions per place. [2023-11-29 02:08:02,870 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 301 selfloop transitions, 188 changer transitions 0/549 dead transitions. [2023-11-29 02:08:02,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 549 transitions, 6467 flow [2023-11-29 02:08:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:08:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:08:02,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 402 transitions. [2023-11-29 02:08:02,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2023-11-29 02:08:02,873 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 402 transitions. [2023-11-29 02:08:02,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 402 transitions. [2023-11-29 02:08:02,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:08:02,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 402 transitions. [2023-11-29 02:08:02,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 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-29 02:08:02,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 80.0) internal successors, (640), 8 states have internal predecessors, (640), 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-29 02:08:02,876 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 80.0) internal successors, (640), 8 states have internal predecessors, (640), 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-29 02:08:02,876 INFO L175 Difference]: Start difference. First operand has 178 places, 374 transitions, 3781 flow. Second operand 7 states and 402 transitions. [2023-11-29 02:08:02,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 549 transitions, 6467 flow [2023-11-29 02:08:07,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 549 transitions, 6457 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 02:08:07,121 INFO L231 Difference]: Finished difference. Result has 185 places, 432 transitions, 5121 flow [2023-11-29 02:08:07,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=3767, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5121, PETRI_PLACES=185, PETRI_TRANSITIONS=432} [2023-11-29 02:08:07,122 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 99 predicate places. [2023-11-29 02:08:07,122 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 432 transitions, 5121 flow [2023-11-29 02:08:07,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.5) internal successors, (372), 8 states have internal predecessors, (372), 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-29 02:08:07,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:08:07,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:08:07,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:08:07,123 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:08:07,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:08:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2102686716, now seen corresponding path program 12 times [2023-11-29 02:08:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:08:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683038018] [2023-11-29 02:08:07,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:08:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:08:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:08:07,258 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-29 02:08:07,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:08:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683038018] [2023-11-29 02:08:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683038018] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:08:07,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:08:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:08:07,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845869917] [2023-11-29 02:08:07,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:08:07,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:08:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:08:07,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:08:07,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:08:07,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2023-11-29 02:08:07,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 432 transitions, 5121 flow. Second operand has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:08:07,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:08:07,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2023-11-29 02:08:07,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:08:29,393 INFO L124 PetriNetUnfolderBase]: 75753/122224 cut-off events. [2023-11-29 02:08:29,393 INFO L125 PetriNetUnfolderBase]: For 515913/519302 co-relation queries the response was YES. [2023-11-29 02:08:30,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489923 conditions, 122224 events. 75753/122224 cut-off events. For 515913/519302 co-relation queries the response was YES. Maximal size of possible extension queue 3326. Compared 1096698 event pairs, 24786 based on Foata normal form. 1467/121169 useless extension candidates. Maximal degree in co-relation 489854. Up to 35182 conditions per place. [2023-11-29 02:08:31,293 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 418 selfloop transitions, 27 changer transitions 9/699 dead transitions. [2023-11-29 02:08:31,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 699 transitions, 8480 flow [2023-11-29 02:08:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:08:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:08:31,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 642 transitions. [2023-11-29 02:08:31,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7295454545454545 [2023-11-29 02:08:31,295 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 642 transitions. [2023-11-29 02:08:31,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 642 transitions. [2023-11-29 02:08:31,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:08:31,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 642 transitions. [2023-11-29 02:08:31,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.36363636363637) internal successors, (642), 11 states have internal predecessors, (642), 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-29 02:08:31,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:08:31,299 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:08:31,300 INFO L175 Difference]: Start difference. First operand has 185 places, 432 transitions, 5121 flow. Second operand 11 states and 642 transitions. [2023-11-29 02:08:31,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 699 transitions, 8480 flow [2023-11-29 02:08:40,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 699 transitions, 8344 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-11-29 02:08:40,209 INFO L231 Difference]: Finished difference. Result has 197 places, 449 transitions, 5232 flow [2023-11-29 02:08:40,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=5035, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5232, PETRI_PLACES=197, PETRI_TRANSITIONS=449} [2023-11-29 02:08:40,209 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 111 predicate places. [2023-11-29 02:08:40,209 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 449 transitions, 5232 flow [2023-11-29 02:08:40,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:08:40,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:08:40,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:08:40,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:08:40,210 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:08:40,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:08:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash 740041906, now seen corresponding path program 13 times [2023-11-29 02:08:40,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:08:40,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088137551] [2023-11-29 02:08:40,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:08:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:08:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:08:40,610 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-29 02:08:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:08:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088137551] [2023-11-29 02:08:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088137551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:08:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:08:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:08:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068595409] [2023-11-29 02:08:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:08:40,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:08:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:08:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:08:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:08:40,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2023-11-29 02:08:40,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 449 transitions, 5232 flow. Second operand has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 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-29 02:08:40,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:08:40,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2023-11-29 02:08:40,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:08:59,557 INFO L124 PetriNetUnfolderBase]: 58009/103453 cut-off events. [2023-11-29 02:08:59,557 INFO L125 PetriNetUnfolderBase]: For 576160/581946 co-relation queries the response was YES. [2023-11-29 02:09:00,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458602 conditions, 103453 events. 58009/103453 cut-off events. For 576160/581946 co-relation queries the response was YES. Maximal size of possible extension queue 3248. Compared 1033136 event pairs, 10323 based on Foata normal form. 2452/103045 useless extension candidates. Maximal degree in co-relation 458529. Up to 21693 conditions per place. [2023-11-29 02:09:00,971 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 435 selfloop transitions, 355 changer transitions 21/891 dead transitions. [2023-11-29 02:09:00,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 891 transitions, 11275 flow [2023-11-29 02:09:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:09:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 02:09:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 784 transitions. [2023-11-29 02:09:00,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7538461538461538 [2023-11-29 02:09:00,973 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 784 transitions. [2023-11-29 02:09:00,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 784 transitions. [2023-11-29 02:09:00,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:09:00,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 784 transitions. [2023-11-29 02:09:00,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 60.30769230769231) internal successors, (784), 13 states have internal predecessors, (784), 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-29 02:09:00,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 80.0) internal successors, (1120), 14 states have internal predecessors, (1120), 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-29 02:09:00,976 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 80.0) internal successors, (1120), 14 states have internal predecessors, (1120), 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-29 02:09:00,976 INFO L175 Difference]: Start difference. First operand has 197 places, 449 transitions, 5232 flow. Second operand 13 states and 784 transitions. [2023-11-29 02:09:00,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 891 transitions, 11275 flow [2023-11-29 02:09:11,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 891 transitions, 11251 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-29 02:09:11,734 INFO L231 Difference]: Finished difference. Result has 220 places, 638 transitions, 9078 flow [2023-11-29 02:09:11,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=5208, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9078, PETRI_PLACES=220, PETRI_TRANSITIONS=638} [2023-11-29 02:09:11,735 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 134 predicate places. [2023-11-29 02:09:11,735 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 638 transitions, 9078 flow [2023-11-29 02:09:11,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 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-29 02:09:11,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:09:11,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:09:11,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:09:11,736 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:09:11,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:09:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1591048592, now seen corresponding path program 14 times [2023-11-29 02:09:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:09:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938628276] [2023-11-29 02:09:11,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:09:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:09:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:11,857 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-29 02:09:11,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:09:11,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938628276] [2023-11-29 02:09:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938628276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:09:11,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:09:11,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:09:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301841305] [2023-11-29 02:09:11,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:09:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:09:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:09:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:09:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:09:11,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2023-11-29 02:09:11,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 638 transitions, 9078 flow. Second operand has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:09:11,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:09:11,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2023-11-29 02:09:11,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:09:48,523 INFO L124 PetriNetUnfolderBase]: 92744/152265 cut-off events. [2023-11-29 02:09:48,523 INFO L125 PetriNetUnfolderBase]: For 988996/995667 co-relation queries the response was YES. [2023-11-29 02:09:50,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699839 conditions, 152265 events. 92744/152265 cut-off events. For 988996/995667 co-relation queries the response was YES. Maximal size of possible extension queue 4001. Compared 1429133 event pairs, 29628 based on Foata normal form. 3404/152551 useless extension candidates. Maximal degree in co-relation 699753. Up to 42064 conditions per place. [2023-11-29 02:09:51,084 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 525 selfloop transitions, 39 changer transitions 19/952 dead transitions. [2023-11-29 02:09:51,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 952 transitions, 13579 flow [2023-11-29 02:09:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:09:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:09:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 653 transitions. [2023-11-29 02:09:51,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7420454545454546 [2023-11-29 02:09:51,086 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 653 transitions. [2023-11-29 02:09:51,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 653 transitions. [2023-11-29 02:09:51,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:09:51,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 653 transitions. [2023-11-29 02:09:51,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 59.36363636363637) internal successors, (653), 11 states have internal predecessors, (653), 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-29 02:09:51,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:09:51,088 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 80.0) internal successors, (960), 12 states have internal predecessors, (960), 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-29 02:09:51,088 INFO L175 Difference]: Start difference. First operand has 220 places, 638 transitions, 9078 flow. Second operand 11 states and 653 transitions. [2023-11-29 02:09:51,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 952 transitions, 13579 flow [2023-11-29 02:10:29,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 952 transitions, 13344 flow, removed 117 selfloop flow, removed 1 redundant places. [2023-11-29 02:10:29,037 INFO L231 Difference]: Finished difference. Result has 235 places, 660 transitions, 9197 flow [2023-11-29 02:10:29,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=8877, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9197, PETRI_PLACES=235, PETRI_TRANSITIONS=660} [2023-11-29 02:10:29,038 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 149 predicate places. [2023-11-29 02:10:29,038 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 660 transitions, 9197 flow [2023-11-29 02:10:29,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 46.888888888888886) internal successors, (422), 9 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:10:29,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:10:29,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:10:29,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:10:29,039 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:10:29,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash 607379578, now seen corresponding path program 15 times [2023-11-29 02:10:29,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332208307] [2023-11-29 02:10:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:29,424 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-29 02:10:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:29,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332208307] [2023-11-29 02:10:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332208307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:10:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273130432] [2023-11-29 02:10:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:29,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:10:29,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:29,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:10:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:10:29,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2023-11-29 02:10:29,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 660 transitions, 9197 flow. Second operand has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 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-29 02:10:29,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:10:29,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2023-11-29 02:10:29,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:10:53,493 INFO L124 PetriNetUnfolderBase]: 57678/103250 cut-off events. [2023-11-29 02:10:53,493 INFO L125 PetriNetUnfolderBase]: For 857504/867959 co-relation queries the response was YES. [2023-11-29 02:10:54,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521131 conditions, 103250 events. 57678/103250 cut-off events. For 857504/867959 co-relation queries the response was YES. Maximal size of possible extension queue 3106. Compared 1029159 event pairs, 10166 based on Foata normal form. 5141/105762 useless extension candidates. Maximal degree in co-relation 521038. Up to 23301 conditions per place. [2023-11-29 02:10:55,170 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 408 selfloop transitions, 367 changer transitions 33/910 dead transitions. [2023-11-29 02:10:55,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 910 transitions, 13139 flow [2023-11-29 02:10:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:10:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 02:10:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 826 transitions. [2023-11-29 02:10:55,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7375 [2023-11-29 02:10:55,172 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 826 transitions. [2023-11-29 02:10:55,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 826 transitions. [2023-11-29 02:10:55,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:10:55,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 826 transitions. [2023-11-29 02:10:55,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 59.0) internal successors, (826), 14 states have internal predecessors, (826), 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-29 02:10:55,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-29 02:10:55,175 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-29 02:10:55,175 INFO L175 Difference]: Start difference. First operand has 235 places, 660 transitions, 9197 flow. Second operand 14 states and 826 transitions. [2023-11-29 02:10:55,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 910 transitions, 13139 flow [2023-11-29 02:11:15,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 910 transitions, 13096 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-11-29 02:11:15,803 INFO L231 Difference]: Finished difference. Result has 255 places, 672 transitions, 10253 flow [2023-11-29 02:11:15,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=9052, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=328, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10253, PETRI_PLACES=255, PETRI_TRANSITIONS=672} [2023-11-29 02:11:15,804 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 169 predicate places. [2023-11-29 02:11:15,804 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 672 transitions, 10253 flow [2023-11-29 02:11:15,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.625) internal successors, (365), 8 states have internal predecessors, (365), 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-29 02:11:15,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:11:15,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:11:15,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:11:15,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:11:15,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 116473404, now seen corresponding path program 16 times [2023-11-29 02:11:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:11:15,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508776350] [2023-11-29 02:11:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:11:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:16,171 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-29 02:11:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:11:16,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508776350] [2023-11-29 02:11:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508776350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:11:16,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:11:16,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:11:16,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345048111] [2023-11-29 02:11:16,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:11:16,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:11:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:11:16,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:11:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:11:16,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2023-11-29 02:11:16,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 672 transitions, 10253 flow. Second operand has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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-29 02:11:16,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:11:16,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2023-11-29 02:11:16,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:11:37,725 INFO L124 PetriNetUnfolderBase]: 48453/88292 cut-off events. [2023-11-29 02:11:37,725 INFO L125 PetriNetUnfolderBase]: For 929415/940589 co-relation queries the response was YES. [2023-11-29 02:11:39,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467819 conditions, 88292 events. 48453/88292 cut-off events. For 929415/940589 co-relation queries the response was YES. Maximal size of possible extension queue 2613. Compared 876306 event pairs, 17921 based on Foata normal form. 2397/88282 useless extension candidates. Maximal degree in co-relation 467717. Up to 67077 conditions per place. [2023-11-29 02:11:39,466 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 491 selfloop transitions, 82 changer transitions 29/741 dead transitions. [2023-11-29 02:11:39,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 741 transitions, 11986 flow [2023-11-29 02:11:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:11:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:11:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 354 transitions. [2023-11-29 02:11:39,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7375 [2023-11-29 02:11:39,468 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 354 transitions. [2023-11-29 02:11:39,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 354 transitions. [2023-11-29 02:11:39,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:11:39,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 354 transitions. [2023-11-29 02:11:39,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 59.0) internal successors, (354), 6 states have internal predecessors, (354), 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-29 02:11:39,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 80.0) internal successors, (560), 7 states have internal predecessors, (560), 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-29 02:11:39,470 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 80.0) internal successors, (560), 7 states have internal predecessors, (560), 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-29 02:11:39,470 INFO L175 Difference]: Start difference. First operand has 255 places, 672 transitions, 10253 flow. Second operand 6 states and 354 transitions. [2023-11-29 02:11:39,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 741 transitions, 11986 flow [2023-11-29 02:11:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 741 transitions, 11505 flow, removed 69 selfloop flow, removed 5 redundant places. [2023-11-29 02:11:59,727 INFO L231 Difference]: Finished difference. Result has 257 places, 641 transitions, 9487 flow [2023-11-29 02:11:59,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=9237, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9487, PETRI_PLACES=257, PETRI_TRANSITIONS=641} [2023-11-29 02:11:59,727 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 171 predicate places. [2023-11-29 02:11:59,727 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 641 transitions, 9487 flow [2023-11-29 02:11:59,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 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-29 02:11:59,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:11:59,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:11:59,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:11:59,728 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:11:59,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:59,728 INFO L85 PathProgramCache]: Analyzing trace with hash 920246982, now seen corresponding path program 17 times [2023-11-29 02:11:59,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:11:59,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225445779] [2023-11-29 02:11:59,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:59,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:11:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:00,105 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-29 02:12:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:12:00,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225445779] [2023-11-29 02:12:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225445779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:00,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:00,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:12:00,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697072071] [2023-11-29 02:12:00,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:00,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:12:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:12:00,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:12:00,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:12:00,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2023-11-29 02:12:00,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 641 transitions, 9487 flow. Second operand has 9 states, 9 states have (on average 45.111111111111114) internal successors, (406), 9 states have internal predecessors, (406), 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-29 02:12:00,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:12:00,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2023-11-29 02:12:00,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:12:27,399 INFO L124 PetriNetUnfolderBase]: 60985/112188 cut-off events. [2023-11-29 02:12:27,399 INFO L125 PetriNetUnfolderBase]: For 1086292/1095228 co-relation queries the response was YES. [2023-11-29 02:12:29,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579674 conditions, 112188 events. 60985/112188 cut-off events. For 1086292/1095228 co-relation queries the response was YES. Maximal size of possible extension queue 3415. Compared 1159123 event pairs, 11526 based on Foata normal form. 4598/114136 useless extension candidates. Maximal degree in co-relation 579570. Up to 27377 conditions per place. [2023-11-29 02:12:29,413 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 571 selfloop transitions, 463 changer transitions 13/1151 dead transitions. [2023-11-29 02:12:29,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1151 transitions, 18179 flow [2023-11-29 02:12:29,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:12:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 02:12:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 840 transitions. [2023-11-29 02:12:29,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2023-11-29 02:12:29,414 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 840 transitions. [2023-11-29 02:12:29,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 840 transitions. [2023-11-29 02:12:29,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:12:29,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 840 transitions. [2023-11-29 02:12:29,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 60.0) internal successors, (840), 14 states have internal predecessors, (840), 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-29 02:12:29,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-29 02:12:29,417 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 80.0) internal successors, (1200), 15 states have internal predecessors, (1200), 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-29 02:12:29,417 INFO L175 Difference]: Start difference. First operand has 257 places, 641 transitions, 9487 flow. Second operand 14 states and 840 transitions. [2023-11-29 02:12:29,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1151 transitions, 18179 flow [2023-11-29 02:12:58,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 1151 transitions, 18081 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-29 02:12:58,987 INFO L231 Difference]: Finished difference. Result has 279 places, 878 transitions, 15090 flow [2023-11-29 02:12:58,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=9416, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=15090, PETRI_PLACES=279, PETRI_TRANSITIONS=878} [2023-11-29 02:12:58,988 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 193 predicate places. [2023-11-29 02:12:58,988 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 878 transitions, 15090 flow [2023-11-29 02:12:58,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 45.111111111111114) internal successors, (406), 9 states have internal predecessors, (406), 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-29 02:12:58,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:12:58,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:12:58,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:12:58,988 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:12:58,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 664003376, now seen corresponding path program 18 times [2023-11-29 02:12:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:12:58,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126995585] [2023-11-29 02:12:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:58,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:12:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:59,298 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-29 02:12:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:12:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126995585] [2023-11-29 02:12:59,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126995585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:59,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:59,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:12:59,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993359425] [2023-11-29 02:12:59,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:59,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:12:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:12:59,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:12:59,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:12:59,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 80 [2023-11-29 02:12:59,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 878 transitions, 15090 flow. Second operand has 10 states, 10 states have (on average 43.8) internal successors, (438), 10 states have internal predecessors, (438), 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-29 02:12:59,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:12:59,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 80 [2023-11-29 02:12:59,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:13:38,482 INFO L124 PetriNetUnfolderBase]: 69736/128553 cut-off events. [2023-11-29 02:13:38,482 INFO L125 PetriNetUnfolderBase]: For 1820822/1841069 co-relation queries the response was YES. [2023-11-29 02:13:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744774 conditions, 128553 events. 69736/128553 cut-off events. For 1820822/1841069 co-relation queries the response was YES. Maximal size of possible extension queue 4172. Compared 1357565 event pairs, 22161 based on Foata normal form. 4082/130292 useless extension candidates. Maximal degree in co-relation 744658. Up to 90435 conditions per place. [2023-11-29 02:13:41,260 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 897 selfloop transitions, 134 changer transitions 3/1124 dead transitions. [2023-11-29 02:13:41,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1124 transitions, 20874 flow [2023-11-29 02:13:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:13:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:13:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 461 transitions. [2023-11-29 02:13:41,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7203125 [2023-11-29 02:13:41,262 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 461 transitions. [2023-11-29 02:13:41,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 461 transitions. [2023-11-29 02:13:41,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:13:41,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 461 transitions. [2023-11-29 02:13:41,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 57.625) internal successors, (461), 8 states have internal predecessors, (461), 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-29 02:13:41,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 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-29 02:13:41,264 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 80.0) internal successors, (720), 9 states have internal predecessors, (720), 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-29 02:13:41,264 INFO L175 Difference]: Start difference. First operand has 279 places, 878 transitions, 15090 flow. Second operand 8 states and 461 transitions. [2023-11-29 02:13:41,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 1124 transitions, 20874 flow [2023-11-29 02:14:41,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 1124 transitions, 20507 flow, removed 183 selfloop flow, removed 1 redundant places. [2023-11-29 02:14:41,124 INFO L231 Difference]: Finished difference. Result has 290 places, 977 transitions, 17315 flow [2023-11-29 02:14:41,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=14863, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=17315, PETRI_PLACES=290, PETRI_TRANSITIONS=977} [2023-11-29 02:14:41,125 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 204 predicate places. [2023-11-29 02:14:41,125 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 977 transitions, 17315 flow [2023-11-29 02:14:41,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 43.8) internal successors, (438), 10 states have internal predecessors, (438), 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-29 02:14:41,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:14:41,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:14:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:14:41,126 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-29 02:14:41,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:14:41,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1091606150, now seen corresponding path program 19 times [2023-11-29 02:14:41,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:14:41,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672310570] [2023-11-29 02:14:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:14:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:14:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:14:41,429 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-29 02:14:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:14:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672310570] [2023-11-29 02:14:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672310570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:14:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:14:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:14:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601517878] [2023-11-29 02:14:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:14:41,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:14:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:14:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:14:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:14:41,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 80 [2023-11-29 02:14:41,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 977 transitions, 17315 flow. Second operand has 9 states, 9 states have (on average 44.22222222222222) internal successors, (398), 9 states have internal predecessors, (398), 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-29 02:14:41,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:14:41,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 80 [2023-11-29 02:14:41,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand