./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI --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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:59:18,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:59:19,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:59:19,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:59:19,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:59:19,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:59:19,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:59:19,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:59:19,125 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:59:19,130 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:59:19,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:59:19,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:59:19,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:59:19,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:59:19,135 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:59:19,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:59:19,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:59:19,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:59:19,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:59:19,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:59:19,139 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:59:19,140 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:59:19,140 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:59:19,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:59:19,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:59:19,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:59:19,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:59:19,142 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:59:19,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:59:19,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:59:19,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:59:19,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:59:19,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:19,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:59:19,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:59:19,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:59:19,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:59:19,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:59:19,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:59:19,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:59:19,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:59:19,149 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_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/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_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI 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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2023-11-24 21:59:19,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:59:19,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:59:19,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:59:19,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:59:19,435 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:59:19,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-24 21:59:22,556 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:59:22,840 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:59:22,841 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-24 21:59:22,860 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/data/6986f34db/f41ff3a9cd2e4cd28cfb26a99be4fc4d/FLAG63bf94b07 [2023-11-24 21:59:22,875 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/data/6986f34db/f41ff3a9cd2e4cd28cfb26a99be4fc4d [2023-11-24 21:59:22,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:59:22,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:59:22,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:22,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:59:22,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:59:22,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:22" (1/1) ... [2023-11-24 21:59:22,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a05c959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:22, skipping insertion in model container [2023-11-24 21:59:22,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:59:22" (1/1) ... [2023-11-24 21:59:22,965 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:59:23,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:23,437 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:59:23,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:59:23,592 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:23,592 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:59:23,600 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:59:23,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23 WrapperNode [2023-11-24 21:59:23,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:59:23,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:23,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:59:23,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:59:23,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,674 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-24 21:59:23,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:59:23,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:59:23,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:59:23,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:59:23,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,713 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-24 21:59:23,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:59:23,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:59:23,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:59:23,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:59:23,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (1/1) ... [2023-11-24 21:59:23,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:59:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:59:23,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 21:59:23,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e62aa562-484d-487c-b505-e960476e9a2e/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 21:59:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:59:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:59:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:59:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:59:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:59:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:59:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:59:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:59:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:59:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:59:23,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:59:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:59:23,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:59:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:59:23,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:59:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 21:59:23,829 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 21:59:23,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:59:23,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:59:23,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:59:23,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:59:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:59:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:59:23,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:59:23,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:59:23,834 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 21:59:24,017 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:59:24,019 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:59:24,539 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:59:24,827 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:59:24,828 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:59:24,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:24 BoogieIcfgContainer [2023-11-24 21:59:24,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:59:24,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:59:24,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:59:24,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:59:24,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:59:22" (1/3) ... [2023-11-24 21:59:24,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcedbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:24, skipping insertion in model container [2023-11-24 21:59:24,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:59:23" (2/3) ... [2023-11-24 21:59:24,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fcedbf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:59:24, skipping insertion in model container [2023-11-24 21:59:24,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:59:24" (3/3) ... [2023-11-24 21:59:24,841 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-11-24 21:59:24,861 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:59:24,861 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 21:59:24,861 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:59:24,933 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:59:24,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-24 21:59:25,036 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-24 21:59:25,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:25,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-24 21:59:25,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-24 21:59:25,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-24 21:59:25,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:59:25,069 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;@333306ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:59:25,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 21:59:25,073 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:59:25,073 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:59:25,074 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:59:25,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:25,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:25,075 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:25,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:25,082 INFO L85 PathProgramCache]: Analyzing trace with hash 13591, now seen corresponding path program 1 times [2023-11-24 21:59:25,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:25,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989353721] [2023-11-24 21:59:25,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:25,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:25,441 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-24 21:59:25,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:25,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989353721] [2023-11-24 21:59:25,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989353721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:25,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:25,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191778777] [2023-11-24 21:59:25,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:25,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:25,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:25,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-24 21:59:25,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-24 21:59:25,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:25,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-24 21:59:25,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:26,283 INFO L124 PetriNetUnfolderBase]: 1175/2199 cut-off events. [2023-11-24 21:59:26,284 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-24 21:59:26,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 2199 events. 1175/2199 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17110 event pairs, 879 based on Foata normal form. 120/2134 useless extension candidates. Maximal degree in co-relation 3921. Up to 1277 conditions per place. [2023-11-24 21:59:26,322 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-24 21:59:26,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 210 flow [2023-11-24 21:59:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-24 21:59:26,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-24 21:59:26,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-24 21:59:26,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-24 21:59:26,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:26,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-24 21:59:26,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-24 21:59:26,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:26,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:26,353 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 152 transitions. [2023-11-24 21:59:26,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 210 flow [2023-11-24 21:59:26,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:59:26,362 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-24 21:59:26,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-24 21:59:26,368 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-24 21:59:26,369 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-24 21:59:26,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-24 21:59:26,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:26,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:59:26,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:59:26,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:26,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 13592, now seen corresponding path program 1 times [2023-11-24 21:59:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776056386] [2023-11-24 21:59:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:26,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:26,516 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-24 21:59:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776056386] [2023-11-24 21:59:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776056386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:26,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561317228] [2023-11-24 21:59:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:26,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:26,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:26,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:26,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-24 21:59:26,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-24 21:59:26,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:26,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-24 21:59:26,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:26,976 INFO L124 PetriNetUnfolderBase]: 1175/2198 cut-off events. [2023-11-24 21:59:26,977 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:59:26,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 2198 events. 1175/2198 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16970 event pairs, 879 based on Foata normal form. 1/2014 useless extension candidates. Maximal degree in co-relation 3981. Up to 1276 conditions per place. [2023-11-24 21:59:27,002 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-24 21:59:27,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 206 flow [2023-11-24 21:59:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-24 21:59:27,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-24 21:59:27,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-24 21:59:27,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-24 21:59:27,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:27,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-24 21:59:27,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-24 21:59:27,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:27,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:27,009 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 152 transitions. [2023-11-24 21:59:27,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 206 flow [2023-11-24 21:59:27,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:27,015 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 21:59:27,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-24 21:59:27,016 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-24 21:59:27,016 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 21:59:27,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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-24 21:59:27,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:27,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:59:27,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:27,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash 405307688, now seen corresponding path program 1 times [2023-11-24 21:59:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:27,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290273657] [2023-11-24 21:59:27,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:27,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:27,090 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-24 21:59:27,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:27,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290273657] [2023-11-24 21:59:27,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290273657] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:27,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:27,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:27,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499053086] [2023-11-24 21:59:27,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:27,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:27,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:27,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:27,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:27,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-24 21:59:27,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-24 21:59:27,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:27,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-24 21:59:27,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:27,535 INFO L124 PetriNetUnfolderBase]: 1176/2196 cut-off events. [2023-11-24 21:59:27,535 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-24 21:59:27,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2196 events. 1176/2196 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16913 event pairs, 879 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 3982. Up to 1276 conditions per place. [2023-11-24 21:59:27,559 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-24 21:59:27,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 206 flow [2023-11-24 21:59:27,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-24 21:59:27,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-24 21:59:27,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-24 21:59:27,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-24 21:59:27,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:27,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-24 21:59:27,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-24 21:59:27,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:27,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:27,564 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 150 transitions. [2023-11-24 21:59:27,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 206 flow [2023-11-24 21:59:27,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:27,571 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 21:59:27,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-24 21:59:27,573 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-24 21:59:27,573 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 21:59:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-24 21:59:27,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:27,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:59:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:59:27,574 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:27,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 405307689, now seen corresponding path program 1 times [2023-11-24 21:59:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226434238] [2023-11-24 21:59:27,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:27,691 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-24 21:59:27,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:27,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226434238] [2023-11-24 21:59:27,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226434238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:27,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:27,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:27,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102977480] [2023-11-24 21:59:27,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:27,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:27,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:27,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:27,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:27,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-24 21:59:27,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-24 21:59:27,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:27,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-24 21:59:27,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:28,159 INFO L124 PetriNetUnfolderBase]: 1175/2194 cut-off events. [2023-11-24 21:59:28,159 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-24 21:59:28,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 2194 events. 1175/2194 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16948 event pairs, 742 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 3979. Up to 1273 conditions per place. [2023-11-24 21:59:28,181 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 21:59:28,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-24 21:59:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-24 21:59:28,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-24 21:59:28,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-24 21:59:28,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-24 21:59:28,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:28,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-24 21:59:28,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-24 21:59:28,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:28,188 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:28,189 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 152 transitions. [2023-11-24 21:59:28,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-24 21:59:28,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:28,194 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-24 21:59:28,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-24 21:59:28,196 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-24 21:59:28,196 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-24 21:59:28,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-24 21:59:28,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:28,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:28,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:59:28,197 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:28,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:28,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1368685508, now seen corresponding path program 1 times [2023-11-24 21:59:28,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:28,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495227927] [2023-11-24 21:59:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:28,273 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-24 21:59:28,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495227927] [2023-11-24 21:59:28,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495227927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:28,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:28,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129524210] [2023-11-24 21:59:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:28,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:28,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-24 21:59:28,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-24 21:59:28,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:28,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-24 21:59:28,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:28,712 INFO L124 PetriNetUnfolderBase]: 1179/2191 cut-off events. [2023-11-24 21:59:28,712 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-24 21:59:28,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 2191 events. 1179/2191 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17142 event pairs, 880 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 3984. Up to 1272 conditions per place. [2023-11-24 21:59:28,737 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 21:59:28,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-24 21:59:28,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-24 21:59:28,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-24 21:59:28,739 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-24 21:59:28,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-24 21:59:28,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:28,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-24 21:59:28,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-24 21:59:28,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:28,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:28,743 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 150 transitions. [2023-11-24 21:59:28,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-24 21:59:28,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:28,750 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-24 21:59:28,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-24 21:59:28,752 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-24 21:59:28,752 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-24 21:59:28,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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-24 21:59:28,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:28,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:28,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:59:28,754 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:28,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1368685509, now seen corresponding path program 1 times [2023-11-24 21:59:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808268080] [2023-11-24 21:59:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:28,848 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-24 21:59:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808268080] [2023-11-24 21:59:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808268080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102769608] [2023-11-24 21:59:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:28,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:28,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:28,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-24 21:59:28,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-24 21:59:28,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:28,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-24 21:59:28,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:29,241 INFO L124 PetriNetUnfolderBase]: 1175/2186 cut-off events. [2023-11-24 21:59:29,241 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-24 21:59:29,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 2186 events. 1175/2186 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16514 event pairs, 611 based on Foata normal form. 4/2020 useless extension candidates. Maximal degree in co-relation 3973. Up to 1264 conditions per place. [2023-11-24 21:59:29,260 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:59:29,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-24 21:59:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-24 21:59:29,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-24 21:59:29,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-24 21:59:29,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-24 21:59:29,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:29,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-24 21:59:29,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-24 21:59:29,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:29,265 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:29,265 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 152 transitions. [2023-11-24 21:59:29,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-24 21:59:29,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:29,268 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-24 21:59:29,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-24 21:59:29,269 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-24 21:59:29,269 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-24 21:59:29,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-24 21:59:29,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:29,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:29,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:59:29,271 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:29,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1909119574, now seen corresponding path program 1 times [2023-11-24 21:59:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252711816] [2023-11-24 21:59:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:29,328 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-24 21:59:29,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:29,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252711816] [2023-11-24 21:59:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252711816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:29,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:29,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466663305] [2023-11-24 21:59:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:29,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:29,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-24 21:59:29,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-24 21:59:29,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:29,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-24 21:59:29,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:29,712 INFO L124 PetriNetUnfolderBase]: 1195/2176 cut-off events. [2023-11-24 21:59:29,712 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-24 21:59:29,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 2176 events. 1195/2176 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16464 event pairs, 777 based on Foata normal form. 0/2029 useless extension candidates. Maximal degree in co-relation 3995. Up to 1264 conditions per place. [2023-11-24 21:59:29,736 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:59:29,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-24 21:59:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-24 21:59:29,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-24 21:59:29,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-24 21:59:29,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-24 21:59:29,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:29,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-24 21:59:29,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-24 21:59:29,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:29,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:29,746 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 150 transitions. [2023-11-24 21:59:29,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-24 21:59:29,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:29,752 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 21:59:29,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-24 21:59:29,753 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-24 21:59:29,754 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 21:59:29,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-24 21:59:29,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:29,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:29,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:59:29,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:29,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:29,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1909119573, now seen corresponding path program 1 times [2023-11-24 21:59:29,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:29,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15365483] [2023-11-24 21:59:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:29,844 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-24 21:59:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:29,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15365483] [2023-11-24 21:59:29,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15365483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:29,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:29,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:59:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828151323] [2023-11-24 21:59:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:29,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:29,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:29,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-24 21:59:29,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-24 21:59:29,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:29,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-24 21:59:29,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:30,228 INFO L124 PetriNetUnfolderBase]: 1175/2106 cut-off events. [2023-11-24 21:59:30,228 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-24 21:59:30,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 2106 events. 1175/2106 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14699 event pairs, 763 based on Foata normal form. 12/1997 useless extension candidates. Maximal degree in co-relation 3901. Up to 1232 conditions per place. [2023-11-24 21:59:30,245 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:59:30,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-24 21:59:30,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-24 21:59:30,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-24 21:59:30,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-24 21:59:30,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-24 21:59:30,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:30,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-24 21:59:30,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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-24 21:59:30,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:30,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:30,249 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 152 transitions. [2023-11-24 21:59:30,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-24 21:59:30,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:30,253 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-24 21:59:30,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-24 21:59:30,255 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-24 21:59:30,256 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-24 21:59:30,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-24 21:59:30,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:30,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:59:30,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:59:30,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:30,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -623877669, now seen corresponding path program 1 times [2023-11-24 21:59:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751439404] [2023-11-24 21:59:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:30,441 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-24 21:59:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751439404] [2023-11-24 21:59:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751439404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:30,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:59:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430892252] [2023-11-24 21:59:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:30,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:59:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:59:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:59:30,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 67 [2023-11-24 21:59:30,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-24 21:59:30,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:30,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 67 [2023-11-24 21:59:30,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:30,767 INFO L124 PetriNetUnfolderBase]: 931/1870 cut-off events. [2023-11-24 21:59:30,767 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-24 21:59:30,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1870 events. 931/1870 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14167 event pairs, 199 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 3313. Up to 1021 conditions per place. [2023-11-24 21:59:30,781 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2023-11-24 21:59:30,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 204 flow [2023-11-24 21:59:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:59:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:59:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-24 21:59:30,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7810945273631841 [2023-11-24 21:59:30,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-24 21:59:30,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-24 21:59:30,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:30,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-24 21:59:30,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-24 21:59:30,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:30,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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-24 21:59:30,785 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 157 transitions. [2023-11-24 21:59:30,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 204 flow [2023-11-24 21:59:30,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:30,788 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 112 flow [2023-11-24 21:59:30,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-24 21:59:30,789 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-24 21:59:30,790 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 112 flow [2023-11-24 21:59:30,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-24 21:59:30,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:30,790 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] [2023-11-24 21:59:30,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:59:30,791 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:30,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 28453398, now seen corresponding path program 1 times [2023-11-24 21:59:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902396685] [2023-11-24 21:59:30,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:31,616 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-24 21:59:31,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:31,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902396685] [2023-11-24 21:59:31,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902396685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:31,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:31,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:59:31,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194929717] [2023-11-24 21:59:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:31,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 21:59:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 21:59:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 21:59:32,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-24 21:59:32,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 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-24 21:59:32,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:32,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-24 21:59:32,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:32,605 INFO L124 PetriNetUnfolderBase]: 1031/1825 cut-off events. [2023-11-24 21:59:32,605 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-24 21:59:32,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3443 conditions, 1825 events. 1031/1825 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 12781 event pairs, 158 based on Foata normal form. 60/1864 useless extension candidates. Maximal degree in co-relation 3432. Up to 756 conditions per place. [2023-11-24 21:59:32,619 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 33 selfloop transitions, 5 changer transitions 10/74 dead transitions. [2023-11-24 21:59:32,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 258 flow [2023-11-24 21:59:32,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:59:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:59:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 353 transitions. [2023-11-24 21:59:32,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6585820895522388 [2023-11-24 21:59:32,623 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 353 transitions. [2023-11-24 21:59:32,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 353 transitions. [2023-11-24 21:59:32,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:32,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 353 transitions. [2023-11-24 21:59:32,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 44.125) internal successors, (353), 8 states have internal predecessors, (353), 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-24 21:59:32,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-24 21:59:32,628 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-24 21:59:32,628 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 8 states and 353 transitions. [2023-11-24 21:59:32,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 258 flow [2023-11-24 21:59:32,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:59:32,631 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-24 21:59:32,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-24 21:59:32,633 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-24 21:59:32,633 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-24 21:59:32,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 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-24 21:59:32,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:32,634 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] [2023-11-24 21:59:32,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:59:32,634 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:32,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 28454623, now seen corresponding path program 1 times [2023-11-24 21:59:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325997419] [2023-11-24 21:59:32,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:32,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:32,888 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-24 21:59:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325997419] [2023-11-24 21:59:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325997419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:32,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:32,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:59:32,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323825642] [2023-11-24 21:59:32,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:32,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:32,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:32,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:32,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:32,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:59:32,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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-24 21:59:32,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:32,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:59:32,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:33,748 INFO L124 PetriNetUnfolderBase]: 3036/5311 cut-off events. [2023-11-24 21:59:33,748 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-24 21:59:33,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9692 conditions, 5311 events. 3036/5311 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 39867 event pairs, 521 based on Foata normal form. 0/5101 useless extension candidates. Maximal degree in co-relation 9681. Up to 2665 conditions per place. [2023-11-24 21:59:33,786 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 36 selfloop transitions, 3 changer transitions 47/110 dead transitions. [2023-11-24 21:59:33,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 110 transitions, 422 flow [2023-11-24 21:59:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:59:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:59:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 384 transitions. [2023-11-24 21:59:33,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-24 21:59:33,790 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 384 transitions. [2023-11-24 21:59:33,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 384 transitions. [2023-11-24 21:59:33,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:33,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 384 transitions. [2023-11-24 21:59:33,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 48.0) internal successors, (384), 8 states have internal predecessors, (384), 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-24 21:59:33,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-24 21:59:33,835 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-24 21:59:33,836 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 8 states and 384 transitions. [2023-11-24 21:59:33,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 110 transitions, 422 flow [2023-11-24 21:59:33,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 110 transitions, 407 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-24 21:59:33,838 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 138 flow [2023-11-24 21:59:33,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-11-24 21:59:33,840 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-24 21:59:33,840 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 138 flow [2023-11-24 21:59:33,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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-24 21:59:33,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:33,840 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] [2023-11-24 21:59:33,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:59:33,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:33,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2077249698, now seen corresponding path program 1 times [2023-11-24 21:59:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704772056] [2023-11-24 21:59:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:34,108 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-24 21:59:34,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:34,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704772056] [2023-11-24 21:59:34,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704772056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:34,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:34,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:59:34,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206349934] [2023-11-24 21:59:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:34,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:59:34,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:59:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:59:34,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-24 21:59:34,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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-24 21:59:34,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:34,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-24 21:59:34,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:35,964 INFO L124 PetriNetUnfolderBase]: 6522/10398 cut-off events. [2023-11-24 21:59:35,964 INFO L125 PetriNetUnfolderBase]: For 6423/6423 co-relation queries the response was YES. [2023-11-24 21:59:36,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24528 conditions, 10398 events. 6522/10398 cut-off events. For 6423/6423 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 74952 event pairs, 1062 based on Foata normal form. 294/10618 useless extension candidates. Maximal degree in co-relation 24512. Up to 4020 conditions per place. [2023-11-24 21:59:36,173 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 46 selfloop transitions, 8 changer transitions 61/136 dead transitions. [2023-11-24 21:59:36,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 136 transitions, 652 flow [2023-11-24 21:59:36,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:59:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:59:36,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 454 transitions. [2023-11-24 21:59:36,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6776119402985075 [2023-11-24 21:59:36,183 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 454 transitions. [2023-11-24 21:59:36,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 454 transitions. [2023-11-24 21:59:36,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:36,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 454 transitions. [2023-11-24 21:59:36,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.4) internal successors, (454), 10 states have internal predecessors, (454), 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-24 21:59:36,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 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-24 21:59:36,188 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 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-24 21:59:36,188 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 138 flow. Second operand 10 states and 454 transitions. [2023-11-24 21:59:36,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 136 transitions, 652 flow [2023-11-24 21:59:36,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 136 transitions, 633 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:36,366 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 237 flow [2023-11-24 21:59:36,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=237, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2023-11-24 21:59:36,367 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2023-11-24 21:59:36,367 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 237 flow [2023-11-24 21:59:36,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 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-24 21:59:36,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:36,367 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] [2023-11-24 21:59:36,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:59:36,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:36,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1016179493, now seen corresponding path program 1 times [2023-11-24 21:59:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750799932] [2023-11-24 21:59:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:36,577 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-24 21:59:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:36,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750799932] [2023-11-24 21:59:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750799932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:59:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207598611] [2023-11-24 21:59:36,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:36,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:59:36,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:59:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:59:36,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:59:36,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 55 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-24 21:59:36,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:36,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:59:36,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:37,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L829-->L832: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][48], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 62#L758true, Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 27#L863-3true, 25#L832true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)))]) [2023-11-24 21:59:37,056 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 21:59:37,056 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:37,056 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:37,057 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:38,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 17#L770true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,073 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-24 21:59:38,074 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:59:38,074 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:59:38,074 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 21:59:38,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,075 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,075 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,075 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,075 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,177 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,178 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,178 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,178 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,178 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,178 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 62#L758true, Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 38#L806true, 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,229 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,229 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,229 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,229 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 17#L770true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,261 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,262 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,262 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,262 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,263 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,263 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,263 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,263 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,278 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,278 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,278 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,278 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,278 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,279 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,279 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,316 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 62#L758true, Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 38#L806true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,316 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,317 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,317 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,317 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,317 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:38,375 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,375 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,375 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,376 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,376 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,376 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [172#true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 62#L758true, Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 48#P2EXITtrue]) [2023-11-24 21:59:38,460 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,461 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,461 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,461 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,482 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [172#true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,483 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,483 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,484 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 38#L806true, Black: 131#(= ~x~0 0), 146#true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 17#L770true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,528 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,528 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,528 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,528 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 38#L806true, 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,530 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,530 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,530 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,530 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,553 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 62#L758true, Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 48#P2EXITtrue]) [2023-11-24 21:59:38,554 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,554 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:38,750 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 38#L806true, 146#true, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:38,751 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,751 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,751 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,751 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,751 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 38#L806true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 17#L770true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,833 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,834 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,834 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,834 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 38#L806true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true]) [2023-11-24 21:59:38,834 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,835 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,835 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,835 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 17#L770true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true, 48#P2EXITtrue]) [2023-11-24 21:59:38,862 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,862 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,863 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,863 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:38,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 58#L763true, 48#P2EXITtrue]) [2023-11-24 21:59:38,863 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,863 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,863 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,864 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,934 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 38#L806true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 22#L877true, 11#L829true]) [2023-11-24 21:59:38,934 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,934 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,934 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,934 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,935 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,966 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 22#L877true, 11#L829true, 58#L763true, 48#P2EXITtrue]) [2023-11-24 21:59:38,966 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,967 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,967 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,967 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:38,967 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:39,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 17#L770true, 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 48#P2EXITtrue]) [2023-11-24 21:59:39,039 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:39,039 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:39,039 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:39,039 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:39,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 6#L773true, P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 48#P2EXITtrue]) [2023-11-24 21:59:39,040 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,040 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,040 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,040 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,129 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][76], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 157#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, Black: 153#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 155#(and (= ~__unbuffered_p3_EAX~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 150#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 146#true, Black: 131#(= ~x~0 0), 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 11#L829true, 22#L877true, 48#P2EXITtrue]) [2023-11-24 21:59:39,130 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,130 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,130 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,130 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:39,130 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:40,039 INFO L124 PetriNetUnfolderBase]: 13408/20385 cut-off events. [2023-11-24 21:59:40,039 INFO L125 PetriNetUnfolderBase]: For 21491/23290 co-relation queries the response was YES. [2023-11-24 21:59:40,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51826 conditions, 20385 events. 13408/20385 cut-off events. For 21491/23290 co-relation queries the response was YES. Maximal size of possible extension queue 1287. Compared 153920 event pairs, 3081 based on Foata normal form. 654/20087 useless extension candidates. Maximal degree in co-relation 51802. Up to 11182 conditions per place. [2023-11-24 21:59:40,352 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 48 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2023-11-24 21:59:40,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 427 flow [2023-11-24 21:59:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:59:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:59:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2023-11-24 21:59:40,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7350746268656716 [2023-11-24 21:59:40,355 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 197 transitions. [2023-11-24 21:59:40,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 197 transitions. [2023-11-24 21:59:40,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:40,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 197 transitions. [2023-11-24 21:59:40,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-24 21:59:40,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-24 21:59:40,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-24 21:59:40,359 INFO L175 Difference]: Start difference. First operand has 79 places, 55 transitions, 237 flow. Second operand 4 states and 197 transitions. [2023-11-24 21:59:40,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 427 flow [2023-11-24 21:59:40,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 411 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-24 21:59:40,677 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 267 flow [2023-11-24 21:59:40,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-11-24 21:59:40,679 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-24 21:59:40,679 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 267 flow [2023-11-24 21:59:40,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-24 21:59:40,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:40,680 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] [2023-11-24 21:59:40,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:59:40,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:40,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash -939705893, now seen corresponding path program 1 times [2023-11-24 21:59:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149772735] [2023-11-24 21:59:40,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:41,020 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-24 21:59:41,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:41,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149772735] [2023-11-24 21:59:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149772735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:41,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:59:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138100309] [2023-11-24 21:59:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:41,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:41,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:41,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:59:41,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-24 21:59:41,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:41,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:59:41,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:42,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, P3Thread1of1ForFork0InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), 146#true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 22#L877true, 58#L763true]) [2023-11-24 21:59:42,648 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:59:42,648 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:42,648 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:42,649 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:59:42,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, 44#L801true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, P3Thread1of1ForFork0InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 22#L877true]) [2023-11-24 21:59:42,790 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:59:42,790 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:42,790 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:42,790 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:59:43,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, P3Thread1of1ForFork0InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), 146#true, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 22#L877true, 58#L763true, 48#P2EXITtrue]) [2023-11-24 21:59:43,337 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:43,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:43,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:43,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:43,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][71], [Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 172#true, Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, P3Thread1of1ForFork0InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), 146#true, 34#P0EXITtrue, Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 22#L877true, 11#L829true, 48#P2EXITtrue]) [2023-11-24 21:59:43,601 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:43,601 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:43,601 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:43,601 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:44,302 INFO L124 PetriNetUnfolderBase]: 13182/21827 cut-off events. [2023-11-24 21:59:44,303 INFO L125 PetriNetUnfolderBase]: For 31254/32342 co-relation queries the response was YES. [2023-11-24 21:59:44,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61351 conditions, 21827 events. 13182/21827 cut-off events. For 31254/32342 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 186758 event pairs, 6188 based on Foata normal form. 384/19596 useless extension candidates. Maximal degree in co-relation 61328. Up to 7896 conditions per place. [2023-11-24 21:59:44,496 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 65 selfloop transitions, 11 changer transitions 0/107 dead transitions. [2023-11-24 21:59:44,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 107 transitions, 599 flow [2023-11-24 21:59:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:59:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:59:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 332 transitions. [2023-11-24 21:59:44,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7078891257995735 [2023-11-24 21:59:44,498 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 332 transitions. [2023-11-24 21:59:44,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 332 transitions. [2023-11-24 21:59:44,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:44,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 332 transitions. [2023-11-24 21:59:44,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.42857142857143) internal successors, (332), 7 states have internal predecessors, (332), 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-24 21:59:44,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 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-24 21:59:44,502 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 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-24 21:59:44,502 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 267 flow. Second operand 7 states and 332 transitions. [2023-11-24 21:59:44,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 107 transitions, 599 flow [2023-11-24 21:59:44,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 589 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-24 21:59:44,511 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 353 flow [2023-11-24 21:59:44,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=353, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2023-11-24 21:59:44,512 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 9 predicate places. [2023-11-24 21:59:44,512 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 353 flow [2023-11-24 21:59:44,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-24 21:59:44,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:44,513 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] [2023-11-24 21:59:44,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:59:44,513 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:44,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1119928265, now seen corresponding path program 1 times [2023-11-24 21:59:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:44,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161496343] [2023-11-24 21:59:44,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:44,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:44,690 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-24 21:59:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:44,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161496343] [2023-11-24 21:59:44,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161496343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:44,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:59:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454989664] [2023-11-24 21:59:44,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:44,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:59:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:44,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:59:44,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:59:44,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:59:44,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 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-24 21:59:44,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:44,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:59:44,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:45,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L829-->L832: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][51], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 44#L801true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 62#L758true, 146#true, 27#L863-3true, 25#L832true, Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-24 21:59:45,290 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 21:59:45,290 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:45,291 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:45,291 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:46,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 38#L806true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:46,730 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,731 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,731 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,731 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 38#L806true, 146#true, 17#L770true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:46,831 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-11-24 21:59:46,831 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-24 21:59:46,832 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-24 21:59:46,832 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-11-24 21:59:46,832 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 38#L806true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:46,832 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,832 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,833 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,833 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,833 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][96], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 22#L877true, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 38#L806true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:46,935 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,935 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,936 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,936 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 38#L806true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:46,946 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,946 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,947 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,947 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 58#L763true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:46,948 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,948 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,948 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,948 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:46,950 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 38#L806true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:46,951 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,951 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,951 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,951 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,951 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:46,951 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:59:47,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 146#true, 38#L806true, 34#P0EXITtrue, 17#L770true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,017 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,018 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 38#L806true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,018 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,018 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,019 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,019 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,019 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 48#P2EXITtrue, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 146#true, 17#L770true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,189 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,189 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,189 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,189 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-11-24 21:59:47,189 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 48#P2EXITtrue, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,190 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,190 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,190 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,190 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,190 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][96], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 22#L877true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 38#L806true, 146#true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:47,256 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,256 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,256 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,257 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][96], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 22#L877true, 48#P2EXITtrue, 58#L763true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:47,297 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,298 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,298 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,298 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,303 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:47,303 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,303 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,304 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 58#L763true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,304 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,305 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,305 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,305 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,305 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,305 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,306 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 38#L806true, 146#true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,306 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,306 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,306 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,306 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,306 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,306 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:59:47,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 146#true, 34#P0EXITtrue, 17#L770true, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:47,351 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-11-24 21:59:47,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-24 21:59:47,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-24 21:59:47,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-11-24 21:59:47,351 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:47,351 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,351 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,351 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,352 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,352 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][96], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), P2Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 22#L877true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 11#L829true, 198#true]) [2023-11-24 21:59:47,430 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,430 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,430 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,430 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,475 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([367] L874-->L877: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][94], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 181#true, 22#L877true, 48#P2EXITtrue, Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 146#true, 34#P0EXITtrue, Black: 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 198#true, 11#L829true]) [2023-11-24 21:59:47,475 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,475 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,475 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,475 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,475 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:47,475 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:59:48,277 INFO L124 PetriNetUnfolderBase]: 16886/25586 cut-off events. [2023-11-24 21:59:48,277 INFO L125 PetriNetUnfolderBase]: For 33544/41082 co-relation queries the response was YES. [2023-11-24 21:59:48,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73389 conditions, 25586 events. 16886/25586 cut-off events. For 33544/41082 co-relation queries the response was YES. Maximal size of possible extension queue 1494. Compared 194843 event pairs, 2541 based on Foata normal form. 1046/25603 useless extension candidates. Maximal degree in co-relation 73361. Up to 11281 conditions per place. [2023-11-24 21:59:48,464 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 62 selfloop transitions, 10 changer transitions 3/106 dead transitions. [2023-11-24 21:59:48,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 106 transitions, 641 flow [2023-11-24 21:59:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 21:59:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-24 21:59:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2023-11-24 21:59:48,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-24 21:59:48,467 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 250 transitions. [2023-11-24 21:59:48,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 250 transitions. [2023-11-24 21:59:48,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:48,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 250 transitions. [2023-11-24 21:59:48,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-24 21:59:48,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 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-24 21:59:48,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 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-24 21:59:48,470 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 353 flow. Second operand 5 states and 250 transitions. [2023-11-24 21:59:48,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 106 transitions, 641 flow [2023-11-24 21:59:48,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 106 transitions, 619 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-24 21:59:48,994 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 370 flow [2023-11-24 21:59:48,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2023-11-24 21:59:48,995 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 14 predicate places. [2023-11-24 21:59:48,995 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 370 flow [2023-11-24 21:59:48,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 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-24 21:59:48,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:48,996 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] [2023-11-24 21:59:48,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:59:48,996 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:48,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:48,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1455458284, now seen corresponding path program 1 times [2023-11-24 21:59:48,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:48,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800275439] [2023-11-24 21:59:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:49,305 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-24 21:59:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800275439] [2023-11-24 21:59:49,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800275439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:49,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:59:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169074766] [2023-11-24 21:59:49,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:49,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:59:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:49,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:59:49,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:59:49,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:59:49,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-24 21:59:49,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:49,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:59:49,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:49,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L829-->L832: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~b~0_2) InVars {~b~0=v_~b~0_2} OutVars{~b~0=v_~b~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0][51], [Black: 183#(= ~x~0 1), Black: 189#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1)), Black: 191#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 187#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x~0 1)), Black: 184#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 44#L801true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 137#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P0Thread1of1ForFork1InUse, Black: 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 131#(= ~x~0 0), Black: 135#(and (= ~x~0 0) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0))), Black: 202#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 177#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#(and (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t973~0#1.base| 0) |ULTIMATE.start_main_~#t974~0#1.base| 0) |ULTIMATE.start_main_~#t976~0#1.base| 0) |ULTIMATE.start_main_~#t975~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t974~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t975~0#1.base|)) (not (= |ULTIMATE.start_main_~#t975~0#1.base| |ULTIMATE.start_main_~#t973~0#1.base|)) (not (= |ULTIMATE.start_main_~#t976~0#1.base| |ULTIMATE.start_main_~#t974~0#1.base|))), 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 161#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 148#(= ~__unbuffered_p3_EAX~0 0), Black: 149#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 159#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 6#L773true, 62#L758true, 217#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 146#true, 25#L832true, 27#L863-3true, Black: 175#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-24 21:59:49,832 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 21:59:49,832 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:49,833 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:49,833 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 21:59:51,808 INFO L124 PetriNetUnfolderBase]: 12190/18466 cut-off events. [2023-11-24 21:59:51,808 INFO L125 PetriNetUnfolderBase]: For 32750/44508 co-relation queries the response was YES. [2023-11-24 21:59:51,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59594 conditions, 18466 events. 12190/18466 cut-off events. For 32750/44508 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 134755 event pairs, 1181 based on Foata normal form. 827/18414 useless extension candidates. Maximal degree in co-relation 59563. Up to 5939 conditions per place. [2023-11-24 21:59:51,935 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 72 selfloop transitions, 14 changer transitions 2/119 dead transitions. [2023-11-24 21:59:51,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 739 flow [2023-11-24 21:59:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 21:59:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 21:59:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 301 transitions. [2023-11-24 21:59:51,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7487562189054726 [2023-11-24 21:59:51,937 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 301 transitions. [2023-11-24 21:59:51,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 301 transitions. [2023-11-24 21:59:51,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:51,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 301 transitions. [2023-11-24 21:59:51,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 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-24 21:59:51,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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-24 21:59:51,941 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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-24 21:59:51,941 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 370 flow. Second operand 6 states and 301 transitions. [2023-11-24 21:59:51,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 739 flow [2023-11-24 21:59:51,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 715 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-24 21:59:51,986 INFO L231 Difference]: Finished difference. Result has 89 places, 72 transitions, 432 flow [2023-11-24 21:59:51,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=432, PETRI_PLACES=89, PETRI_TRANSITIONS=72} [2023-11-24 21:59:51,987 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 15 predicate places. [2023-11-24 21:59:51,987 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 72 transitions, 432 flow [2023-11-24 21:59:51,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.0) internal successors, (234), 6 states have internal predecessors, (234), 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-24 21:59:51,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:51,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] [2023-11-24 21:59:51,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-24 21:59:51,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:51,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1041192835, now seen corresponding path program 1 times [2023-11-24 21:59:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370580735] [2023-11-24 21:59:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:51,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:52,272 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-24 21:59:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:52,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370580735] [2023-11-24 21:59:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370580735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:52,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 21:59:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233371810] [2023-11-24 21:59:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:59:52,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:59:52,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:59:52,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-24 21:59:52,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 72 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-24 21:59:52,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:52,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-24 21:59:52,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:59:55,984 INFO L124 PetriNetUnfolderBase]: 14926/25199 cut-off events. [2023-11-24 21:59:55,984 INFO L125 PetriNetUnfolderBase]: For 58922/65110 co-relation queries the response was YES. [2023-11-24 21:59:56,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80827 conditions, 25199 events. 14926/25199 cut-off events. For 58922/65110 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 216824 event pairs, 3593 based on Foata normal form. 552/23433 useless extension candidates. Maximal degree in co-relation 80796. Up to 8428 conditions per place. [2023-11-24 21:59:56,153 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 83 selfloop transitions, 17 changer transitions 29/164 dead transitions. [2023-11-24 21:59:56,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 164 transitions, 1174 flow [2023-11-24 21:59:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:59:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:59:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 378 transitions. [2023-11-24 21:59:56,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7052238805970149 [2023-11-24 21:59:56,156 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 378 transitions. [2023-11-24 21:59:56,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 378 transitions. [2023-11-24 21:59:56,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:59:56,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 378 transitions. [2023-11-24 21:59:56,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 47.25) internal successors, (378), 8 states have internal predecessors, (378), 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-24 21:59:56,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-24 21:59:56,160 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 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-24 21:59:56,160 INFO L175 Difference]: Start difference. First operand has 89 places, 72 transitions, 432 flow. Second operand 8 states and 378 transitions. [2023-11-24 21:59:56,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 164 transitions, 1174 flow [2023-11-24 21:59:56,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 164 transitions, 1143 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-24 21:59:56,810 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 546 flow [2023-11-24 21:59:56,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=546, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-11-24 21:59:56,811 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 25 predicate places. [2023-11-24 21:59:56,811 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 546 flow [2023-11-24 21:59:56,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 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-24 21:59:56,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:59:56,812 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] [2023-11-24 21:59:56,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-24 21:59:56,812 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:59:56,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:59:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1529943095, now seen corresponding path program 2 times [2023-11-24 21:59:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:59:56,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105538292] [2023-11-24 21:59:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:59:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:59:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:59:57,072 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-24 21:59:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:59:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105538292] [2023-11-24 21:59:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105538292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:59:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:59:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 21:59:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619431472] [2023-11-24 21:59:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:59:57,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 21:59:57,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:59:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 21:59:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-24 21:59:57,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:59:57,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 546 flow. Second operand has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-24 21:59:57,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:59:57,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:59:57,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:00:00,632 INFO L124 PetriNetUnfolderBase]: 15244/23113 cut-off events. [2023-11-24 22:00:00,632 INFO L125 PetriNetUnfolderBase]: For 60654/68265 co-relation queries the response was YES. [2023-11-24 22:00:01,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78073 conditions, 23113 events. 15244/23113 cut-off events. For 60654/68265 co-relation queries the response was YES. Maximal size of possible extension queue 1591. Compared 176150 event pairs, 1236 based on Foata normal form. 944/23177 useless extension candidates. Maximal degree in co-relation 78036. Up to 8437 conditions per place. [2023-11-24 22:00:01,064 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 56 selfloop transitions, 18 changer transitions 26/129 dead transitions. [2023-11-24 22:00:01,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 129 transitions, 920 flow [2023-11-24 22:00:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:00:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 22:00:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 336 transitions. [2023-11-24 22:00:01,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-24 22:00:01,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 336 transitions. [2023-11-24 22:00:01,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 336 transitions. [2023-11-24 22:00:01,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:00:01,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 336 transitions. [2023-11-24 22:00:01,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 48.0) internal successors, (336), 7 states have internal predecessors, (336), 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-24 22:00:01,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 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-24 22:00:01,071 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 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-24 22:00:01,071 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 546 flow. Second operand 7 states and 336 transitions. [2023-11-24 22:00:01,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 129 transitions, 920 flow [2023-11-24 22:00:01,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 874 flow, removed 21 selfloop flow, removed 7 redundant places. [2023-11-24 22:00:01,656 INFO L231 Difference]: Finished difference. Result has 96 places, 72 transitions, 462 flow [2023-11-24 22:00:01,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=462, PETRI_PLACES=96, PETRI_TRANSITIONS=72} [2023-11-24 22:00:01,657 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-11-24 22:00:01,657 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 462 flow [2023-11-24 22:00:01,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.714285714285715) internal successors, (271), 7 states have internal predecessors, (271), 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-24 22:00:01,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:00:01,658 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] [2023-11-24 22:00:01,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-24 22:00:01,658 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:00:01,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:00:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2004513556, now seen corresponding path program 1 times [2023-11-24 22:00:01,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:00:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574070485] [2023-11-24 22:00:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:00:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:00:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:00:02,077 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-24 22:00:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:00:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574070485] [2023-11-24 22:00:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574070485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:00:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:00:02,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:00:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955666280] [2023-11-24 22:00:02,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:00:02,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:00:02,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:00:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:00:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:00:02,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-24 22:00:02,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 462 flow. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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-24 22:00:02,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:00:02,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-24 22:00:02,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:00:03,668 INFO L124 PetriNetUnfolderBase]: 5154/9497 cut-off events. [2023-11-24 22:00:03,669 INFO L125 PetriNetUnfolderBase]: For 29363/31024 co-relation queries the response was YES. [2023-11-24 22:00:03,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31306 conditions, 9497 events. 5154/9497 cut-off events. For 29363/31024 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 79345 event pairs, 641 based on Foata normal form. 145/8752 useless extension candidates. Maximal degree in co-relation 31272. Up to 3591 conditions per place. [2023-11-24 22:00:03,724 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 41 selfloop transitions, 12 changer transitions 34/124 dead transitions. [2023-11-24 22:00:03,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 124 transitions, 873 flow [2023-11-24 22:00:03,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 22:00:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 22:00:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 311 transitions. [2023-11-24 22:00:03,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631130063965884 [2023-11-24 22:00:03,727 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 311 transitions. [2023-11-24 22:00:03,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 311 transitions. [2023-11-24 22:00:03,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:00:03,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 311 transitions. [2023-11-24 22:00:03,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.42857142857143) internal successors, (311), 7 states have internal predecessors, (311), 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-24 22:00:03,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 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-24 22:00:03,732 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 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-24 22:00:03,732 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 462 flow. Second operand 7 states and 311 transitions. [2023-11-24 22:00:03,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 124 transitions, 873 flow [2023-11-24 22:00:04,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 124 transitions, 764 flow, removed 34 selfloop flow, removed 9 redundant places. [2023-11-24 22:00:04,003 INFO L231 Difference]: Finished difference. Result has 96 places, 72 transitions, 436 flow [2023-11-24 22:00:04,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=96, PETRI_TRANSITIONS=72} [2023-11-24 22:00:04,003 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-11-24 22:00:04,004 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 72 transitions, 436 flow [2023-11-24 22:00:04,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 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-24 22:00:04,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:00:04,004 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] [2023-11-24 22:00:04,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-24 22:00:04,005 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:00:04,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:00:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash -548301170, now seen corresponding path program 2 times [2023-11-24 22:00:04,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:00:04,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766951842] [2023-11-24 22:00:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:00:04,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:00:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:00:05,425 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-24 22:00:05,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:00:05,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766951842] [2023-11-24 22:00:05,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766951842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:00:05,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:00:05,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 22:00:05,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064643803] [2023-11-24 22:00:05,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:00:05,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 22:00:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:00:05,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 22:00:05,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-24 22:00:05,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-24 22:00:05,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 72 transitions, 436 flow. Second operand has 9 states, 9 states have (on average 36.44444444444444) internal successors, (328), 9 states have internal predecessors, (328), 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-24 22:00:05,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:00:05,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-24 22:00:05,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:00:06,948 INFO L124 PetriNetUnfolderBase]: 4218/7863 cut-off events. [2023-11-24 22:00:06,948 INFO L125 PetriNetUnfolderBase]: For 19640/20186 co-relation queries the response was YES. [2023-11-24 22:00:07,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24021 conditions, 7863 events. 4218/7863 cut-off events. For 19640/20186 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 65231 event pairs, 1214 based on Foata normal form. 78/7069 useless extension candidates. Maximal degree in co-relation 23988. Up to 2490 conditions per place. [2023-11-24 22:00:07,023 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 41 selfloop transitions, 20 changer transitions 25/125 dead transitions. [2023-11-24 22:00:07,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 125 transitions, 912 flow [2023-11-24 22:00:07,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 22:00:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 22:00:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 417 transitions. [2023-11-24 22:00:07,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6223880597014926 [2023-11-24 22:00:07,028 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 417 transitions. [2023-11-24 22:00:07,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 417 transitions. [2023-11-24 22:00:07,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:00:07,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 417 transitions. [2023-11-24 22:00:07,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 41.7) internal successors, (417), 10 states have internal predecessors, (417), 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-24 22:00:07,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 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-24 22:00:07,034 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 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-24 22:00:07,035 INFO L175 Difference]: Start difference. First operand has 96 places, 72 transitions, 436 flow. Second operand 10 states and 417 transitions. [2023-11-24 22:00:07,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 125 transitions, 912 flow [2023-11-24 22:00:07,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 125 transitions, 853 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-24 22:00:07,312 INFO L231 Difference]: Finished difference. Result has 101 places, 82 transitions, 570 flow [2023-11-24 22:00:07,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=570, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2023-11-24 22:00:07,313 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 27 predicate places. [2023-11-24 22:00:07,313 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 570 flow [2023-11-24 22:00:07,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.44444444444444) internal successors, (328), 9 states have internal predecessors, (328), 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-24 22:00:07,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:00:07,314 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] [2023-11-24 22:00:07,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-24 22:00:07,314 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:00:07,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:00:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash 958678422, now seen corresponding path program 3 times [2023-11-24 22:00:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:00:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860502730] [2023-11-24 22:00:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:00:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:00:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:00:07,570 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-24 22:00:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:00:07,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860502730] [2023-11-24 22:00:07,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860502730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:00:07,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:00:07,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 22:00:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811474992] [2023-11-24 22:00:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:00:07,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:00:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:00:07,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:00:07,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:00:07,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 22:00:07,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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-24 22:00:07,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:00:07,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 22:00:07,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:00:09,067 INFO L124 PetriNetUnfolderBase]: 4683/8809 cut-off events. [2023-11-24 22:00:09,067 INFO L125 PetriNetUnfolderBase]: For 20280/21403 co-relation queries the response was YES. [2023-11-24 22:00:09,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25835 conditions, 8809 events. 4683/8809 cut-off events. For 20280/21403 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 76513 event pairs, 1475 based on Foata normal form. 176/7868 useless extension candidates. Maximal degree in co-relation 25801. Up to 3084 conditions per place. [2023-11-24 22:00:09,130 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 27 selfloop transitions, 1 changer transitions 41/110 dead transitions. [2023-11-24 22:00:09,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 110 transitions, 783 flow [2023-11-24 22:00:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:00:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:00:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 274 transitions. [2023-11-24 22:00:09,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.681592039800995 [2023-11-24 22:00:09,133 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 274 transitions. [2023-11-24 22:00:09,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 274 transitions. [2023-11-24 22:00:09,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:00:09,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 274 transitions. [2023-11-24 22:00:09,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.666666666666664) internal successors, (274), 6 states have internal predecessors, (274), 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-24 22:00:09,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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-24 22:00:09,138 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 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-24 22:00:09,138 INFO L175 Difference]: Start difference. First operand has 101 places, 82 transitions, 570 flow. Second operand 6 states and 274 transitions. [2023-11-24 22:00:09,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 110 transitions, 783 flow [2023-11-24 22:00:09,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 110 transitions, 762 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-24 22:00:09,408 INFO L231 Difference]: Finished difference. Result has 102 places, 65 transitions, 353 flow [2023-11-24 22:00:09,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=102, PETRI_TRANSITIONS=65} [2023-11-24 22:00:09,409 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 28 predicate places. [2023-11-24 22:00:09,409 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 65 transitions, 353 flow [2023-11-24 22:00:09,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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-24 22:00:09,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:00:09,410 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] [2023-11-24 22:00:09,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-24 22:00:09,410 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 22:00:09,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:00:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1592878122, now seen corresponding path program 4 times [2023-11-24 22:00:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:00:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660937838] [2023-11-24 22:00:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:00:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:00:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 22:00:09,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 22:00:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat