./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.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_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 21:53:40,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 21:53:40,312 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 21:53:40,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 21:53:40,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 21:53:40,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 21:53:40,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 21:53:40,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 21:53:40,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 21:53:40,346 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 21:53:40,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 21:53:40,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 21:53:40,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 21:53:40,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 21:53:40,349 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 21:53:40,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 21:53:40,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 21:53:40,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 21:53:40,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 21:53:40,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 21:53:40,353 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 21:53:40,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 21:53:40,355 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 21:53:40,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 21:53:40,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 21:53:40,357 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 21:53:40,357 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 21:53:40,358 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 21:53:40,359 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 21:53:40,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 21:53:40,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 21:53:40,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 21:53:40,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:53:40,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 21:53:40,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 21:53:40,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 21:53:40,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 21:53:40,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 21:53:40,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 21:53:40,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 21:53:40,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 21:53:40,367 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_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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 -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f [2023-11-24 21:53:40,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 21:53:40,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 21:53:40,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 21:53:40,730 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 21:53:40,731 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 21:53:40,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:53:43,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 21:53:44,390 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 21:53:44,390 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:53:44,415 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/data/ff89863b7/c489aabbb70441d3801620be127f7392/FLAG1a7875390 [2023-11-24 21:53:44,591 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/data/ff89863b7/c489aabbb70441d3801620be127f7392 [2023-11-24 21:53:44,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 21:53:44,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 21:53:44,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 21:53:44,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 21:53:44,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 21:53:44,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:53:44" (1/1) ... [2023-11-24 21:53:44,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b62115f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:44, skipping insertion in model container [2023-11-24 21:53:44,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 09:53:44" (1/1) ... [2023-11-24 21:53:44,671 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 21:53:45,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:53:45,264 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 21:53:45,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 21:53:45,439 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:53:45,439 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 21:53:45,447 INFO L206 MainTranslator]: Completed translation [2023-11-24 21:53:45,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45 WrapperNode [2023-11-24 21:53:45,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 21:53:45,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 21:53:45,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 21:53:45,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 21:53:45,460 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:53:45" (1/1) ... [2023-11-24 21:53:45,506 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:53:45" (1/1) ... [2023-11-24 21:53:45,554 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-24 21:53:45,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 21:53:45,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 21:53:45,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 21:53:45,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 21:53:45,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,627 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:53:45,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 21:53:45,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 21:53:45,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 21:53:45,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 21:53:45,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (1/1) ... [2023-11-24 21:53:45,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 21:53:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 21:53:45,738 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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:53:45,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f754e8e-cefe-416a-aa5a-f8df8104a8ad/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:53:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 21:53:45,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 21:53:45,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 21:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 21:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-24 21:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 21:53:45,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 21:53:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 21:53:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 21:53:45,790 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-24 21:53:45,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-24 21:53:45,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-24 21:53:45,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-24 21:53:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-24 21:53:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-24 21:53:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-24 21:53:45,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-24 21:53:45,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 21:53:45,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 21:53:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 21:53:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 21:53:45,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-24 21:53:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 21:53:45,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 21:53:45,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 21:53:45,798 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:53:45,979 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 21:53:45,982 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 21:53:46,459 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 21:53:46,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 21:53:46,814 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-24 21:53:46,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:53:46 BoogieIcfgContainer [2023-11-24 21:53:46,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 21:53:46,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 21:53:46,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 21:53:46,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 21:53:46,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 09:53:44" (1/3) ... [2023-11-24 21:53:46,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61da6751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:53:46, skipping insertion in model container [2023-11-24 21:53:46,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 09:53:45" (2/3) ... [2023-11-24 21:53:46,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61da6751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 09:53:46, skipping insertion in model container [2023-11-24 21:53:46,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 09:53:46" (3/3) ... [2023-11-24 21:53:46,826 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-24 21:53:46,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 21:53:46,848 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-24 21:53:46,848 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 21:53:46,921 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 21:53:46,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-24 21:53:47,037 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-24 21:53:47,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:53:47,043 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 130 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:53:47,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-24 21:53:47,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-24 21:53:47,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 21:53:47,093 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;@2f5b09dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 21:53:47,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-24 21:53:47,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 21:53:47,096 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 21:53:47,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 21:53:47,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:47,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:53:47,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:47,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:47,103 INFO L85 PathProgramCache]: Analyzing trace with hash 14366, now seen corresponding path program 1 times [2023-11-24 21:53:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154525223] [2023-11-24 21:53:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:47,451 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:53:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154525223] [2023-11-24 21:53:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154525223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:47,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:47,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:53:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422670753] [2023-11-24 21:53:47,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:47,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:47,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:47,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:47,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:53:47,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:53:47,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:47,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:53:47,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:49,335 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-24 21:53:49,336 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-24 21:53:49,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54556 event pairs, 3179 based on Foata normal form. 360/6916 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-24 21:53:49,432 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-24 21:53:49,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-24 21:53:49,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-24 21:53:49,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-24 21:53:49,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-24 21:53:49,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-24 21:53:49,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:49,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-24 21:53:49,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:53:49,468 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:53:49,468 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:53:49,470 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-24 21:53:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-24 21:53:49,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-24 21:53:49,481 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-24 21:53:49,483 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:53:49,487 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-24 21:53:49,488 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-24 21:53:49,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:53:49,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:49,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 21:53:49,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 21:53:49,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:49,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash 14367, now seen corresponding path program 1 times [2023-11-24 21:53:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941858290] [2023-11-24 21:53:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:49,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:49,613 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:53:49,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:49,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941858290] [2023-11-24 21:53:49,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941858290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:49,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:53:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837165694] [2023-11-24 21:53:49,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:49,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:49,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:49,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:53:49,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:53:49,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:49,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:53:49,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:51,123 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-24 21:53:51,124 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-24 21:53:51,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 54711 event pairs, 3179 based on Foata normal form. 1/6556 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-24 21:53:51,209 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-24 21:53:51,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-24 21:53:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-24 21:53:51,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-24 21:53:51,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-24 21:53:51,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-24 21:53:51,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:51,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-24 21:53:51,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:53:51,228 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:53:51,229 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:53:51,230 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-24 21:53:51,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-24 21:53:51,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:51,246 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-24 21:53:51,247 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:53:51,254 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-24 21:53:51,255 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-24 21:53:51,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:53:51,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:51,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:53:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 21:53:51,256 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:51,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash 428416841, now seen corresponding path program 1 times [2023-11-24 21:53:51,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89671713] [2023-11-24 21:53:51,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:51,405 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:53:51,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:51,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89671713] [2023-11-24 21:53:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89671713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:53:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141244610] [2023-11-24 21:53:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:51,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:51,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:51,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:53:51,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:53:51,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:51,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:53:51,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:52,849 INFO L124 PetriNetUnfolderBase]: 4221/7245 cut-off events. [2023-11-24 21:53:52,849 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-24 21:53:52,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13358 conditions, 7245 events. 4221/7245 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54264 event pairs, 3251 based on Foata normal form. 0/6528 useless extension candidates. Maximal degree in co-relation 13347. Up to 4393 conditions per place. [2023-11-24 21:53:52,936 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-24 21:53:52,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-24 21:53:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-24 21:53:52,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-24 21:53:52,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-24 21:53:52,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-24 21:53:52,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:52,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-24 21:53:52,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:53:52,945 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:53:52,945 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:53:52,945 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-24 21:53:52,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-24 21:53:52,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:52,956 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-24 21:53:52,956 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:53:52,957 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-24 21:53:52,958 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-24 21:53:52,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:53:52,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:52,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:53:52,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 21:53:52,959 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:52,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash 428416842, now seen corresponding path program 1 times [2023-11-24 21:53:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:52,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240071442] [2023-11-24 21:53:52,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:52,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:53,091 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:53:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240071442] [2023-11-24 21:53:53,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240071442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:53,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:53:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071849942] [2023-11-24 21:53:53,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:53,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:53,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:53,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:53,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:53:53,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:53:53,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:53,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:53:53,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:54,504 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-24 21:53:54,505 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-24 21:53:54,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 7272 events. 4217/7272 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55027 event pairs, 2503 based on Foata normal form. 5/6563 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-24 21:53:54,568 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-24 21:53:54,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-24 21:53:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-24 21:53:54,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-24 21:53:54,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-24 21:53:54,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-24 21:53:54,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:54,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-24 21:53:54,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states 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:53:54,574 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:53:54,575 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:53:54,575 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-24 21:53:54,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-24 21:53:54,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:54,582 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-24 21:53:54,583 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:53:54,585 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-24 21:53:54,586 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-24 21:53:54,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:53:54,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:54,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 21:53:54,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 21:53:54,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:54,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash 428418495, now seen corresponding path program 1 times [2023-11-24 21:53:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:54,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580408161] [2023-11-24 21:53:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:54,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:54,748 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:53:54,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:54,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580408161] [2023-11-24 21:53:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580408161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:54,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:54,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 21:53:54,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909159038] [2023-11-24 21:53:54,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:54,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:54,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-24 21:53:54,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:53:54,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:54,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-24 21:53:54,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:55,664 INFO L124 PetriNetUnfolderBase]: 3311/5485 cut-off events. [2023-11-24 21:53:55,665 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-24 21:53:55,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10310 conditions, 5485 events. 3311/5485 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39115 event pairs, 593 based on Foata normal form. 0/5382 useless extension candidates. Maximal degree in co-relation 10300. Up to 3661 conditions per place. [2023-11-24 21:53:55,710 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-24 21:53:55,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-24 21:53:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-24 21:53:55,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-24 21:53:55,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-24 21:53:55,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-24 21:53:55,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:55,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-24 21:53:55,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states 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:53:55,714 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:53:55,715 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:53:55,715 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-24 21:53:55,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-24 21:53:55,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:55,719 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-24 21:53:55,719 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=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-24 21:53:55,720 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-24 21:53:55,720 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-24 21:53:55,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:53:55,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:55,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:53:55,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 21:53:55,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:55,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1676249144, now seen corresponding path program 1 times [2023-11-24 21:53:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184463616] [2023-11-24 21:53:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:55,769 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:53:55,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:55,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184463616] [2023-11-24 21:53:55,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184463616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:55,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:55,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:53:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508241863] [2023-11-24 21:53:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:55,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:55,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:55,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:55,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:55,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:53:55,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:53:55,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:55,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:53:55,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:56,741 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-24 21:53:56,741 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-24 21:53:56,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9645 conditions, 5209 events. 2920/5209 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 38221 event pairs, 1356 based on Foata normal form. 0/4914 useless extension candidates. Maximal degree in co-relation 9634. Up to 3460 conditions per place. [2023-11-24 21:53:56,791 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 21:53:56,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-24 21:53:56,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:56,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-24 21:53:56,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-24 21:53:56,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-24 21:53:56,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-24 21:53:56,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:56,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-24 21:53:56,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:53:56,796 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:53:56,796 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:53:56,797 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-24 21:53:56,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-24 21:53:56,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:56,800 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-24 21:53:56,800 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:53:56,804 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-24 21:53:56,804 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-24 21:53:56,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:53:56,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:56,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:53:56,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 21:53:56,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:56,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:56,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1676249143, now seen corresponding path program 1 times [2023-11-24 21:53:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:56,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330458445] [2023-11-24 21:53:56,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:56,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:56,911 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:53:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:56,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330458445] [2023-11-24 21:53:56,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330458445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:56,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:56,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:53:56,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045543185] [2023-11-24 21:53:56,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:56,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:56,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:56,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:53:56,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:53:56,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:56,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:53:56,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:57,742 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-24 21:53:57,742 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-24 21:53:57,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9409 conditions, 5128 events. 2903/5128 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37360 event pairs, 1884 based on Foata normal form. 12/4849 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-24 21:53:57,782 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-24 21:53:57,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-24 21:53:57,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:53:57,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-24 21:53:57,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:53:57,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:53:57,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:57,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:53:57,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:53:57,786 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:53:57,787 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:53:57,787 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:53:57,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-24 21:53:57,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:57,791 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-24 21:53:57,791 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:53:57,793 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-24 21:53:57,793 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-24 21:53:57,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:53:57,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:57,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:53:57,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 21:53:57,794 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:57,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash 446943736, now seen corresponding path program 1 times [2023-11-24 21:53:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:57,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435201359] [2023-11-24 21:53:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:57,854 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:53:57,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:57,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435201359] [2023-11-24 21:53:57,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435201359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:57,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:57,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:53:57,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031419886] [2023-11-24 21:53:57,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:57,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:57,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:57,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:57,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:57,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-24 21:53:57,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:53:57,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:57,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-24 21:53:57,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:58,706 INFO L124 PetriNetUnfolderBase]: 2978/5159 cut-off events. [2023-11-24 21:53:58,706 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-24 21:53:58,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5159 events. 2978/5159 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37018 event pairs, 1424 based on Foata normal form. 0/4932 useless extension candidates. Maximal degree in co-relation 9541. Up to 3426 conditions per place. [2023-11-24 21:53:58,762 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 21:53:58,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-24 21:53:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-24 21:53:58,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-24 21:53:58,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-24 21:53:58,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-24 21:53:58,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:58,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-24 21:53:58,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:53:58,767 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:53:58,768 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:53:58,768 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-24 21:53:58,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-24 21:53:58,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:58,771 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-24 21:53:58,771 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-24 21:53:58,772 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-24 21:53:58,772 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-24 21:53:58,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:53:58,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:58,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 21:53:58,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 21:53:58,774 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:58,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 446943737, now seen corresponding path program 1 times [2023-11-24 21:53:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:58,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945077696] [2023-11-24 21:53:58,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:58,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:53:58,870 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:53:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:53:58,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945077696] [2023-11-24 21:53:58,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945077696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:53:58,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:53:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 21:53:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332786314] [2023-11-24 21:53:58,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:53:58,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 21:53:58,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:53:58,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 21:53:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 21:53:58,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-24 21:53:58,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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:53:58,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:53:58,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-24 21:53:58,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:53:59,787 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-24 21:53:59,788 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-24 21:53:59,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 5108 events. 2903/5108 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37094 event pairs, 920 based on Foata normal form. 36/4953 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-24 21:53:59,836 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-24 21:53:59,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-24 21:53:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 21:53:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 21:53:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-24 21:53:59,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-24 21:53:59,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-24 21:53:59,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-24 21:53:59,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:53:59,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-24 21:53:59,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:53:59,841 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:53:59,841 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:53:59,841 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-24 21:53:59,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-24 21:53:59,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:53:59,844 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-24 21:53:59,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-24 21:53:59,846 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-24 21:53:59,846 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-24 21:53:59,846 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:53:59,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:53:59,847 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:53:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 21:53:59,847 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:53:59,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:53:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 698157759, now seen corresponding path program 1 times [2023-11-24 21:53:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:53:59,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157324467] [2023-11-24 21:53:59,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:53:59,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:53:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:01,038 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:54:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157324467] [2023-11-24 21:54:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157324467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:01,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-24 21:54:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531191440] [2023-11-24 21:54:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:01,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 21:54:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 21:54:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-24 21:54:01,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-24 21:54:01,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 11 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:54:01,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:01,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-24 21:54:01,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:54:02,593 INFO L124 PetriNetUnfolderBase]: 3664/5653 cut-off events. [2023-11-24 21:54:02,594 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-24 21:54:02,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11024 conditions, 5653 events. 3664/5653 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35883 event pairs, 0 based on Foata normal form. 180/5745 useless extension candidates. Maximal degree in co-relation 11013. Up to 3384 conditions per place. [2023-11-24 21:54:02,640 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 49 selfloop transitions, 5 changer transitions 13/88 dead transitions. [2023-11-24 21:54:02,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 88 transitions, 324 flow [2023-11-24 21:54:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 21:54:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-24 21:54:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2023-11-24 21:54:02,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6194029850746269 [2023-11-24 21:54:02,643 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 332 transitions. [2023-11-24 21:54:02,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 332 transitions. [2023-11-24 21:54:02,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:54:02,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 332 transitions. [2023-11-24 21:54:02,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.5) internal successors, (332), 8 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:54:02,646 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:54:02,647 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:54:02,647 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 332 transitions. [2023-11-24 21:54:02,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 88 transitions, 324 flow [2023-11-24 21:54:02,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 21:54:02,650 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-24 21:54:02,651 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:54:02,651 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-24 21:54:02,652 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-24 21:54:02,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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:54:02,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:54:02,652 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:54:02,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 21:54:02,653 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:54:02,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:54:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 698159135, now seen corresponding path program 1 times [2023-11-24 21:54:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:54:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434988463] [2023-11-24 21:54:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:54:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:54:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:02,884 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:54:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:02,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434988463] [2023-11-24 21:54:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434988463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:54:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345449171] [2023-11-24 21:54:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:02,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:54:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:02,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:54:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:54:02,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-24 21:54:02,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:54:02,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:02,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-24 21:54:02,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:54:07,422 INFO L124 PetriNetUnfolderBase]: 26337/38302 cut-off events. [2023-11-24 21:54:07,422 INFO L125 PetriNetUnfolderBase]: For 1896/1896 co-relation queries the response was YES. [2023-11-24 21:54:07,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76095 conditions, 38302 events. 26337/38302 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 1702. Compared 277501 event pairs, 7125 based on Foata normal form. 0/37247 useless extension candidates. Maximal degree in co-relation 76084. Up to 16162 conditions per place. [2023-11-24 21:54:07,620 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 46 selfloop transitions, 7 changer transitions 95/166 dead transitions. [2023-11-24 21:54:07,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 166 transitions, 668 flow [2023-11-24 21:54:07,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 21:54:07,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-24 21:54:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 429 transitions. [2023-11-24 21:54:07,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-24 21:54:07,629 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 429 transitions. [2023-11-24 21:54:07,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 429 transitions. [2023-11-24 21:54:07,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:54:07,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 429 transitions. [2023-11-24 21:54:07,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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:54:07,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:54:07,635 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states 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:54:07,635 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 9 states and 429 transitions. [2023-11-24 21:54:07,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 166 transitions, 668 flow [2023-11-24 21:54:07,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 166 transitions, 648 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-24 21:54:07,641 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 202 flow [2023-11-24 21:54:07,642 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=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-11-24 21:54:07,642 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-24 21:54:07,643 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 202 flow [2023-11-24 21:54:07,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:54:07,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:54:07,643 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:54:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 21:54:07,644 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:54:07,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:54:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -937436226, now seen corresponding path program 1 times [2023-11-24 21:54:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:54:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448889192] [2023-11-24 21:54:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:54:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:54:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:07,901 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:54:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:07,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448889192] [2023-11-24 21:54:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448889192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:07,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:07,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:54:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396125393] [2023-11-24 21:54:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:07,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:54:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:07,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:54:07,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:54:07,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-24 21:54:07,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:54:07,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:07,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-24 21:54:07,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:54:11,370 INFO L124 PetriNetUnfolderBase]: 14782/23928 cut-off events. [2023-11-24 21:54:11,370 INFO L125 PetriNetUnfolderBase]: For 22140/24118 co-relation queries the response was YES. [2023-11-24 21:54:11,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63410 conditions, 23928 events. 14782/23928 cut-off events. For 22140/24118 co-relation queries the response was YES. Maximal size of possible extension queue 1154. Compared 192167 event pairs, 4633 based on Foata normal form. 844/24115 useless extension candidates. Maximal degree in co-relation 63391. Up to 13009 conditions per place. [2023-11-24 21:54:11,595 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 34 selfloop transitions, 3 changer transitions 43/106 dead transitions. [2023-11-24 21:54:11,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 530 flow [2023-11-24 21:54:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:54:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:54:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-24 21:54:11,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844349680170576 [2023-11-24 21:54:11,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-24 21:54:11,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-24 21:54:11,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:54:11,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-24 21:54:11,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:54:11,602 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:54:11,603 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:54:11,603 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 202 flow. Second operand 7 states and 321 transitions. [2023-11-24 21:54:11,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 530 flow [2023-11-24 21:54:11,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 480 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-24 21:54:11,920 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 191 flow [2023-11-24 21:54:11,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-11-24 21:54:11,921 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-24 21:54:11,922 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 191 flow [2023-11-24 21:54:11,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:54:11,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:54:11,922 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] [2023-11-24 21:54:11,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 21:54:11,923 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:54:11,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:54:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1621319587, now seen corresponding path program 1 times [2023-11-24 21:54:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:54:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190618501] [2023-11-24 21:54:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:54:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:54:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:12,160 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:54:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190618501] [2023-11-24 21:54:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190618501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:54:12,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636608279] [2023-11-24 21:54:12,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 21:54:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:12,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 21:54:12,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-24 21:54:12,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-24 21:54:12,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 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:54:12,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:12,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-24 21:54:12,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:54:16,120 INFO L124 PetriNetUnfolderBase]: 18071/26711 cut-off events. [2023-11-24 21:54:16,120 INFO L125 PetriNetUnfolderBase]: For 27843/28030 co-relation queries the response was YES. [2023-11-24 21:54:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74161 conditions, 26711 events. 18071/26711 cut-off events. For 27843/28030 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 185560 event pairs, 5479 based on Foata normal form. 649/27324 useless extension candidates. Maximal degree in co-relation 74139. Up to 13648 conditions per place. [2023-11-24 21:54:16,291 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 63 selfloop transitions, 11 changer transitions 74/166 dead transitions. [2023-11-24 21:54:16,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 166 transitions, 905 flow [2023-11-24 21:54:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 21:54:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-24 21:54:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 457 transitions. [2023-11-24 21:54:16,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.682089552238806 [2023-11-24 21:54:16,294 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 457 transitions. [2023-11-24 21:54:16,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 457 transitions. [2023-11-24 21:54:16,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:54:16,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 457 transitions. [2023-11-24 21:54:16,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.7) internal successors, (457), 10 states have internal predecessors, (457), 0 states have call successors, (0), 0 states 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:54:16,298 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:54:16,299 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:54:16,299 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 191 flow. Second operand 10 states and 457 transitions. [2023-11-24 21:54:16,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 166 transitions, 905 flow [2023-11-24 21:54:16,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 166 transitions, 863 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-24 21:54:16,992 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 262 flow [2023-11-24 21:54:16,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-11-24 21:54:16,992 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2023-11-24 21:54:16,993 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 262 flow [2023-11-24 21:54:16,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 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:54:16,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:54:16,993 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:54:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-24 21:54:16,994 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:54:16,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:54:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 47499102, now seen corresponding path program 1 times [2023-11-24 21:54:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:54:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669560884] [2023-11-24 21:54:16,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:54:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:54:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:17,149 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:54:17,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:17,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669560884] [2023-11-24 21:54:17,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669560884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:17,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:17,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 21:54:17,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079184443] [2023-11-24 21:54:17,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:17,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 21:54:17,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:17,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 21:54:17,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-24 21:54:17,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-24 21:54:17,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 58 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:54:17,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:17,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-24 21:54:17,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:54:22,816 INFO L124 PetriNetUnfolderBase]: 28938/43345 cut-off events. [2023-11-24 21:54:22,816 INFO L125 PetriNetUnfolderBase]: For 35241/38208 co-relation queries the response was YES. [2023-11-24 21:54:23,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107081 conditions, 43345 events. 28938/43345 cut-off events. For 35241/38208 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 317450 event pairs, 5152 based on Foata normal form. 1569/43545 useless extension candidates. Maximal degree in co-relation 107057. Up to 23158 conditions per place. [2023-11-24 21:54:23,147 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 57 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2023-11-24 21:54:23,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 92 transitions, 484 flow [2023-11-24 21:54:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 21:54:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 21:54:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-24 21:54:23,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-24 21:54:23,149 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-24 21:54:23,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-24 21:54:23,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:54:23,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-24 21:54:23,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states 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:54:23,151 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:54:23,152 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:54:23,152 INFO L175 Difference]: Start difference. First operand has 79 places, 58 transitions, 262 flow. Second operand 4 states and 194 transitions. [2023-11-24 21:54:23,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 92 transitions, 484 flow [2023-11-24 21:54:23,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 468 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-24 21:54:23,988 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 292 flow [2023-11-24 21:54:23,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-11-24 21:54:23,989 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-24 21:54:23,989 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 292 flow [2023-11-24 21:54:23,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:54:23,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:54:23,990 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:54:23,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 21:54:23,990 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:54:23,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:54:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash 400558442, now seen corresponding path program 1 times [2023-11-24 21:54:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:54:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375954706] [2023-11-24 21:54:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:54:23,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:54:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:24,259 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:54:24,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375954706] [2023-11-24 21:54:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375954706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:24,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 21:54:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372868878] [2023-11-24 21:54:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:24,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:54:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:54:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:54:24,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-24 21:54:24,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:54:24,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:24,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-24 21:54:24,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 21:54:26,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, 36#L881true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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: 137#(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: 133#(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))), 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:26,794 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,795 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,795 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,795 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, 37#L883true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:26,796 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,796 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,796 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:54:26,796 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-24 21:54:27,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 37#L883true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:27,100 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,101 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,101 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,101 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: 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][77], [Black: 173#(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))), 170#true, 33#L808true, 70#L795true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 51#L831true, Black: 137#(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)))), 195#true, 49#L892true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true]) [2023-11-24 21:54:27,122 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,122 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,122 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,122 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 10#L889true, P3Thread1of1ForFork3InUse, Black: 139#(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: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:27,123 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,123 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,123 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,123 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 21:54:27,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: 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][77], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 51#L831true, Black: 137#(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)))), 195#true, 49#L892true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true]) [2023-11-24 21:54:27,709 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,710 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,710 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,710 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 10#L889true, P3Thread1of1ForFork3InUse, Black: 139#(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: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:27,711 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,711 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,711 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,711 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,742 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 50#P0EXITtrue, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 36#L881true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 27#P1EXITtrue, Black: 137#(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: 133#(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))), 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:27,742 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,742 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,742 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,742 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 37#L883true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 27#P1EXITtrue, Black: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:27,743 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,743 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,743 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:27,743 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 21:54:28,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 37#L883true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 27#P1EXITtrue, Black: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 204#true, Black: 172#(= ~x~0 0), 23#L847true]) [2023-11-24 21:54:28,096 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,096 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,097 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,097 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: 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][77], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 51#L831true, 27#P1EXITtrue, Black: 137#(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)))), 195#true, 49#L892true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 204#true, Black: 172#(= ~x~0 0)]) [2023-11-24 21:54:28,123 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,123 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,123 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,123 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 10#L889true, Black: 139#(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)))), 27#P1EXITtrue, Black: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:28,124 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,124 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,124 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,124 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 21:54:28,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: 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][77], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 51#L831true, 27#P1EXITtrue, Black: 137#(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)))), 195#true, 49#L892true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true]) [2023-11-24 21:54:28,681 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,681 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,681 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,681 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(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))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 10#L889true, P3Thread1of1ForFork3InUse, Black: 139#(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)))), 27#P1EXITtrue, Black: 137#(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)))), 195#true, Black: 133#(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: 183#(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: 185#(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)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-24 21:54:28,683 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:54:28,683 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 21:54:30,754 INFO L124 PetriNetUnfolderBase]: 28881/44928 cut-off events. [2023-11-24 21:54:30,754 INFO L125 PetriNetUnfolderBase]: For 36709/39627 co-relation queries the response was YES. [2023-11-24 21:54:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117709 conditions, 44928 events. 28881/44928 cut-off events. For 36709/39627 co-relation queries the response was YES. Maximal size of possible extension queue 2350. Compared 373127 event pairs, 12841 based on Foata normal form. 908/42185 useless extension candidates. Maximal degree in co-relation 117685. Up to 17515 conditions per place. [2023-11-24 21:54:31,113 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 83 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2023-11-24 21:54:31,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 670 flow [2023-11-24 21:54:31,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 21:54:31,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-24 21:54:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2023-11-24 21:54:31,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993603411513859 [2023-11-24 21:54:31,116 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 328 transitions. [2023-11-24 21:54:31,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 328 transitions. [2023-11-24 21:54:31,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 21:54:31,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 328 transitions. [2023-11-24 21:54:31,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.857142857142854) internal successors, (328), 7 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 21:54:31,120 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:54:31,120 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:54:31,120 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 292 flow. Second operand 7 states and 328 transitions. [2023-11-24 21:54:31,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 670 flow [2023-11-24 21:54:31,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 124 transitions, 664 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-24 21:54:31,192 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 367 flow [2023-11-24 21:54:31,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2023-11-24 21:54:31,193 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-24 21:54:31,193 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 367 flow [2023-11-24 21:54:31,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 21:54:31,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 21:54:31,193 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:54:31,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 21:54:31,194 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-24 21:54:31,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 21:54:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash -594031303, now seen corresponding path program 1 times [2023-11-24 21:54:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 21:54:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945636784] [2023-11-24 21:54:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 21:54:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 21:54:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 21:54:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 21:54:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 21:54:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945636784] [2023-11-24 21:54:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945636784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 21:54:31,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 21:54:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 21:54:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372691001] [2023-11-24 21:54:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 21:54:31,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 21:54:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 21:54:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 21:54:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 21:54:31,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-24 21:54:31,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:54:31,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 21:54:31,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-24 21:54:31,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand