./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix023_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:11:53,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:11:53,145 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 00:11:53,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:11:53,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:11:53,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:11:53,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:11:53,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:11:53,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:11:53,177 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:11:53,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:11:53,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:11:53,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:11:53,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:11:53,180 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:11:53,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:11:53,181 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:11:53,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:11:53,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:11:53,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:11:53,183 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:11:53,184 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:11:53,184 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:11:53,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:11:53,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:11:53,185 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:11:53,186 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:11:53,186 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:11:53,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:11:53,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:11:53,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:11:53,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:11:53,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:11:53,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:11:53,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:11:53,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:11:53,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:11:53,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:11:53,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:11:53,190 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:11:53,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:11:53,191 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_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2023-11-29 00:11:53,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:11:53,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:11:53,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:11:53,426 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:11:53,426 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:11:53,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 00:11:56,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:11:56,418 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:11:56,419 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 00:11:56,436 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data/52b7f6e79/f0b78104d17b4208b32f4ade9a2af8b8/FLAG56f708b01 [2023-11-29 00:11:56,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data/52b7f6e79/f0b78104d17b4208b32f4ade9a2af8b8 [2023-11-29 00:11:56,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:11:56,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:11:56,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:11:56,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:11:56,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:11:56,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:56" (1/1) ... [2023-11-29 00:11:56,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213ebeab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:56, skipping insertion in model container [2023-11-29 00:11:56,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:11:56" (1/1) ... [2023-11-29 00:11:56,520 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:11:56,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:11:56,906 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:11:56,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:11:56,994 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:11:56,994 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:11:57,001 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:11:57,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57 WrapperNode [2023-11-29 00:11:57,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:11:57,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:11:57,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:11:57,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:11:57,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,055 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-29 00:11:57,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:11:57,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:11:57,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:11:57,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:11:57,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,091 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-29 00:11:57,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:11:57,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:11:57,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:11:57,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:11:57,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (1/1) ... [2023-11-29 00:11:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:11:57,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:11:57,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:11:57,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:11:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 00:11:57,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 00:11:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 00:11:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 00:11:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 00:11:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:11:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:11:57,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:11:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:11:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:11:57,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:11:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:11:57,185 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:11:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:11:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:11:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 00:11:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 00:11:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:11:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 00:11:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 00:11:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 00:11:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 00:11:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:11:57,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:11:57,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:11:57,189 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:11:57,338 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:11:57,340 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:11:57,693 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:11:57,895 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:11:57,895 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:11:57,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:57 BoogieIcfgContainer [2023-11-29 00:11:57,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:11:57,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:11:57,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:11:57,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:11:57,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:11:56" (1/3) ... [2023-11-29 00:11:57,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7044a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:11:57, skipping insertion in model container [2023-11-29 00:11:57,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:11:57" (2/3) ... [2023-11-29 00:11:57,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7044a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:11:57, skipping insertion in model container [2023-11-29 00:11:57,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:57" (3/3) ... [2023-11-29 00:11:57,905 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 00:11:57,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:11:57,925 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 00:11:57,925 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:11:57,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:11:58,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 00:11:58,054 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 00:11:58,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:11:58,059 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 136 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-29 00:11:58,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 00:11:58,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 00:11:58,073 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:11:58,080 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;@1c004528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:11:58,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 00:11:58,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:11:58,083 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:11:58,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:11:58,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:58,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:11:58,084 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-29 00:11:58,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 14263, now seen corresponding path program 1 times [2023-11-29 00:11:58,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:58,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978453830] [2023-11-29 00:11:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978453830] [2023-11-29 00:11:58,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978453830] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:58,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850227170] [2023-11-29 00:11:58,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:58,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:58,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:58,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:58,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:11:58,407 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-29 00:11:58,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:58,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:11:58,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:11:59,684 INFO L124 PetriNetUnfolderBase]: 4217/7243 cut-off events. [2023-11-29 00:11:59,685 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 00:11:59,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13170 conditions, 7243 events. 4217/7243 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54851 event pairs, 3179 based on Foata normal form. 360/6976 useless extension candidates. Maximal degree in co-relation 13155. Up to 4391 conditions per place. [2023-11-29 00:11:59,763 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 00:11:59,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-29 00:11:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:11:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:11:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:11:59,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:11:59,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:11:59,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:11:59,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:11:59,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:11:59,785 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-29 00:11:59,788 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-29 00:11:59,789 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-29 00:11:59,791 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:11:59,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-29 00:11:59,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:11:59,801 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 00:11:59,803 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-29 00:11:59,807 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 00:11:59,807 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 00:11:59,808 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-29 00:11:59,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:11:59,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:11:59,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:11:59,808 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-29 00:11:59,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 14264, now seen corresponding path program 1 times [2023-11-29 00:11:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:11:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787345223] [2023-11-29 00:11:59,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:11:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:11:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787345223] [2023-11-29 00:11:59,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787345223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:59,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:11:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21039112] [2023-11-29 00:11:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:59,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:11:59,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:11:59,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:11:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:11:59,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:11:59,936 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-29 00:11:59,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:11:59,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:11:59,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:01,097 INFO L124 PetriNetUnfolderBase]: 4217/7242 cut-off events. [2023-11-29 00:12:01,097 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 00:12:01,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13346 conditions, 7242 events. 4217/7242 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54903 event pairs, 3179 based on Foata normal form. 1/6616 useless extension candidates. Maximal degree in co-relation 13335. Up to 4390 conditions per place. [2023-11-29 00:12:01,161 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 00:12:01,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-29 00:12:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:12:01,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:12:01,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:12:01,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:12:01,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:01,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:12:01,166 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-29 00:12:01,168 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-29 00:12:01,168 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-29 00:12:01,168 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:12:01,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-29 00:12:01,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:01,182 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 00:12:01,183 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-29 00:12:01,184 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 00:12:01,184 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 00:12:01,184 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-29 00:12:01,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:01,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:12:01,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:12:01,185 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-29 00:12:01,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 425346362, now seen corresponding path program 1 times [2023-11-29 00:12:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231407175] [2023-11-29 00:12:01,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:01,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:01,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231407175] [2023-11-29 00:12:01,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231407175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:01,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:01,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537511898] [2023-11-29 00:12:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:01,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:01,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:01,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:12:01,268 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-29 00:12:01,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:01,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:12:01,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:02,349 INFO L124 PetriNetUnfolderBase]: 4221/7205 cut-off events. [2023-11-29 00:12:02,349 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 00:12:02,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13318 conditions, 7205 events. 4221/7205 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54495 event pairs, 3251 based on Foata normal form. 0/6588 useless extension candidates. Maximal degree in co-relation 13307. Up to 4393 conditions per place. [2023-11-29 00:12:02,405 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 00:12:02,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-29 00:12:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-29 00:12:02,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 00:12:02,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-29 00:12:02,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-29 00:12:02,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:02,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-29 00:12:02,409 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-29 00:12:02,410 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-29 00:12:02,410 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-29 00:12:02,411 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-29 00:12:02,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-29 00:12:02,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:02,418 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 00:12:02,419 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-29 00:12:02,419 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 00:12:02,420 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 00:12:02,420 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-29 00:12:02,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:02,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:12:02,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:12:02,420 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-29 00:12:02,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash 425346363, now seen corresponding path program 1 times [2023-11-29 00:12:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:02,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055750298] [2023-11-29 00:12:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:02,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055750298] [2023-11-29 00:12:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055750298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:02,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943861115] [2023-11-29 00:12:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:02,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:02,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:02,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:12:02,513 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-29 00:12:02,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:02,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:12:02,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:03,322 INFO L124 PetriNetUnfolderBase]: 4217/7232 cut-off events. [2023-11-29 00:12:03,323 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 00:12:03,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13340 conditions, 7232 events. 4217/7232 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55421 event pairs, 2503 based on Foata normal form. 5/6623 useless extension candidates. Maximal degree in co-relation 13330. Up to 4384 conditions per place. [2023-11-29 00:12:03,360 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 00:12:03,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 00:12:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:12:03,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:12:03,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:12:03,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:12:03,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:03,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:12:03,364 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-29 00:12:03,366 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-29 00:12:03,366 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-29 00:12:03,367 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:12:03,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 00:12:03,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:03,371 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 00:12:03,371 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-29 00:12:03,372 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 00:12:03,373 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 00:12:03,373 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-29 00:12:03,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:03,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:12:03,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:12:03,373 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-29 00:12:03,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:03,374 INFO L85 PathProgramCache]: Analyzing trace with hash 425348036, now seen corresponding path program 1 times [2023-11-29 00:12:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:03,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111539553] [2023-11-29 00:12:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:03,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:03,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111539553] [2023-11-29 00:12:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111539553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:03,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:03,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:12:03,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324193300] [2023-11-29 00:12:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:03,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:03,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:03,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:03,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:03,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 00:12:03,467 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-29 00:12:03,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:03,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 00:12:03,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:04,225 INFO L124 PetriNetUnfolderBase]: 3311/5477 cut-off events. [2023-11-29 00:12:04,226 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 00:12:04,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10302 conditions, 5477 events. 3311/5477 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 40234 event pairs, 593 based on Foata normal form. 0/5402 useless extension candidates. Maximal degree in co-relation 10292. Up to 3661 conditions per place. [2023-11-29 00:12:04,255 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-29 00:12:04,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-29 00:12:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-29 00:12:04,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-29 00:12:04,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-29 00:12:04,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-29 00:12:04,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:04,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-29 00:12:04,258 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-29 00:12:04,259 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-29 00:12:04,259 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-29 00:12:04,259 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-29 00:12:04,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-29 00:12:04,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:04,262 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-29 00:12:04,262 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-29 00:12:04,263 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 00:12:04,263 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-29 00:12:04,264 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-29 00:12:04,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:04,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:04,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:12:04,264 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-29 00:12:04,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1340388304, now seen corresponding path program 1 times [2023-11-29 00:12:04,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:04,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581118633] [2023-11-29 00:12:04,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581118633] [2023-11-29 00:12:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581118633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:04,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712894406] [2023-11-29 00:12:04,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:04,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:04,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:04,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:04,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:12:04,329 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-29 00:12:04,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:04,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:12:04,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:04,837 INFO L124 PetriNetUnfolderBase]: 2920/5177 cut-off events. [2023-11-29 00:12:04,837 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 00:12:04,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 5177 events. 2920/5177 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 38326 event pairs, 1356 based on Foata normal form. 0/4962 useless extension candidates. Maximal degree in co-relation 9602. Up to 3460 conditions per place. [2023-11-29 00:12:04,864 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 00:12:04,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-29 00:12:04,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 00:12:04,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 00:12:04,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 00:12:04,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 00:12:04,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:04,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 00:12:04,867 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-29 00:12:04,868 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-29 00:12:04,868 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-29 00:12:04,868 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-29 00:12:04,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-29 00:12:04,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:04,871 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 00:12:04,871 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-29 00:12:04,872 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 00:12:04,872 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 00:12:04,873 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-29 00:12:04,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:04,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:04,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:12:04,874 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-29 00:12:04,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:04,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1340388305, now seen corresponding path program 1 times [2023-11-29 00:12:04,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723771977] [2023-11-29 00:12:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:04,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:04,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723771977] [2023-11-29 00:12:04,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723771977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:04,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:04,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142622353] [2023-11-29 00:12:04,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:04,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:04,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:04,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:12:04,959 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-29 00:12:04,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:04,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:12:04,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:05,523 INFO L124 PetriNetUnfolderBase]: 2903/5096 cut-off events. [2023-11-29 00:12:05,523 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 00:12:05,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5096 events. 2903/5096 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 37506 event pairs, 1884 based on Foata normal form. 12/4897 useless extension candidates. Maximal degree in co-relation 9367. Up to 3431 conditions per place. [2023-11-29 00:12:05,546 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 00:12:05,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-29 00:12:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 00:12:05,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 00:12:05,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 00:12:05,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 00:12:05,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:05,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 00:12:05,550 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-29 00:12:05,550 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-29 00:12:05,551 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-29 00:12:05,551 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 00:12:05,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-29 00:12:05,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:05,555 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 00:12:05,555 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-29 00:12:05,555 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 00:12:05,556 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 00:12:05,556 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-29 00:12:05,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:05,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:05,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:12:05,556 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-29 00:12:05,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1197453914, now seen corresponding path program 1 times [2023-11-29 00:12:05,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231584238] [2023-11-29 00:12:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:05,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:05,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231584238] [2023-11-29 00:12:05,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231584238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715517993] [2023-11-29 00:12:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:05,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:05,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:12:05,626 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-29 00:12:05,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:05,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:12:05,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:06,147 INFO L124 PetriNetUnfolderBase]: 2978/5127 cut-off events. [2023-11-29 00:12:06,148 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 00:12:06,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9519 conditions, 5127 events. 2978/5127 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 37036 event pairs, 1424 based on Foata normal form. 0/4980 useless extension candidates. Maximal degree in co-relation 9509. Up to 3426 conditions per place. [2023-11-29 00:12:06,169 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 00:12:06,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 00:12:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 00:12:06,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 00:12:06,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 00:12:06,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 00:12:06,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:06,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 00:12:06,172 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-29 00:12:06,173 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-29 00:12:06,173 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-29 00:12:06,173 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-29 00:12:06,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 00:12:06,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:06,175 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 00:12:06,175 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-29 00:12:06,176 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 00:12:06,176 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 00:12:06,176 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-29 00:12:06,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:06,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:06,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:12:06,177 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-29 00:12:06,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:06,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1197453915, now seen corresponding path program 1 times [2023-11-29 00:12:06,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:06,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654638131] [2023-11-29 00:12:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:06,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654638131] [2023-11-29 00:12:06,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654638131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:06,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:12:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446338578] [2023-11-29 00:12:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:06,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:12:06,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:06,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:12:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:12:06,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:12:06,272 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-29 00:12:06,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:06,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:12:06,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:06,817 INFO L124 PetriNetUnfolderBase]: 2903/5076 cut-off events. [2023-11-29 00:12:06,818 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 00:12:06,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9381 conditions, 5076 events. 2903/5076 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 37275 event pairs, 920 based on Foata normal form. 36/4977 useless extension candidates. Maximal degree in co-relation 9371. Up to 3315 conditions per place. [2023-11-29 00:12:06,839 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 00:12:06,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 00:12:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:12:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:12:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 00:12:06,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 00:12:06,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 00:12:06,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 00:12:06,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:06,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 00:12:06,841 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-29 00:12:06,842 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-29 00:12:06,842 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-29 00:12:06,843 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-29 00:12:06,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 00:12:06,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:06,845 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 00:12:06,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-29 00:12:06,846 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 00:12:06,846 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 00:12:06,847 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-29 00:12:06,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:06,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-29 00:12:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:12:06,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-29 00:12:06,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1216810646, now seen corresponding path program 1 times [2023-11-29 00:12:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429506806] [2023-11-29 00:12:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:07,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:07,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429506806] [2023-11-29 00:12:07,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429506806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:07,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:12:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732956942] [2023-11-29 00:12:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:07,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:12:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:12:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:12:07,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-29 00:12:07,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 33.77777777777778) internal successors, (304), 9 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-29 00:12:07,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:08,565 INFO L124 PetriNetUnfolderBase]: 2920/4941 cut-off events. [2023-11-29 00:12:08,565 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 00:12:08,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9276 conditions, 4941 events. 2920/4941 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 35011 event pairs, 1148 based on Foata normal form. 144/4953 useless extension candidates. Maximal degree in co-relation 9265. Up to 3315 conditions per place. [2023-11-29 00:12:08,586 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 36 selfloop transitions, 4 changer transitions 11/74 dead transitions. [2023-11-29 00:12:08,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 262 flow [2023-11-29 00:12:08,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:12:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:12:08,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 276 transitions. [2023-11-29 00:12:08,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5884861407249466 [2023-11-29 00:12:08,588 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 276 transitions. [2023-11-29 00:12:08,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 276 transitions. [2023-11-29 00:12:08,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:08,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 276 transitions. [2023-11-29 00:12:08,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.42857142857143) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:08,590 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-29 00:12:08,591 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-29 00:12:08,591 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 7 states and 276 transitions. [2023-11-29 00:12:08,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 262 flow [2023-11-29 00:12:08,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:08,593 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 112 flow [2023-11-29 00:12:08,593 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-11-29 00:12:08,594 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 00:12:08,594 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 112 flow [2023-11-29 00:12:08,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.77777777777778) internal successors, (304), 9 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:08,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:08,595 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-29 00:12:08,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:12:08,595 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-29 00:12:08,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1216809334, now seen corresponding path program 1 times [2023-11-29 00:12:08,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:08,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635404513] [2023-11-29 00:12:08,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:08,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:08,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635404513] [2023-11-29 00:12:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635404513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:08,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:08,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:12:08,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026189614] [2023-11-29 00:12:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:08,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:12:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:08,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:12:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:12:08,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 67 [2023-11-29 00:12:08,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:08,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:08,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 67 [2023-11-29 00:12:08,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:14,261 INFO L124 PetriNetUnfolderBase]: 45528/64865 cut-off events. [2023-11-29 00:12:14,261 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-29 00:12:14,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126470 conditions, 64865 events. 45528/64865 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 2728. Compared 471890 event pairs, 10223 based on Foata normal form. 0/63327 useless extension candidates. Maximal degree in co-relation 126459. Up to 22989 conditions per place. [2023-11-29 00:12:14,488 INFO L140 encePairwiseOnDemand]: 54/67 looper letters, 48 selfloop transitions, 9 changer transitions 109/182 dead transitions. [2023-11-29 00:12:14,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 182 transitions, 720 flow [2023-11-29 00:12:14,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:12:14,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:12:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 429 transitions. [2023-11-29 00:12:14,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-29 00:12:14,491 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 429 transitions. [2023-11-29 00:12:14,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 429 transitions. [2023-11-29 00:12:14,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:14,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 429 transitions. [2023-11-29 00:12:14,494 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-29 00:12:14,496 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-29 00:12:14,496 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-29 00:12:14,496 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 112 flow. Second operand 9 states and 429 transitions. [2023-11-29 00:12:14,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 182 transitions, 720 flow [2023-11-29 00:12:14,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 182 transitions, 710 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:12:14,501 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 229 flow [2023-11-29 00:12:14,501 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=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=229, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-11-29 00:12:14,502 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 00:12:14,502 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 229 flow [2023-11-29 00:12:14,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:14,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:14,502 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-29 00:12:14,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:12:14,503 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-29 00:12:14,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash -917527575, now seen corresponding path program 1 times [2023-11-29 00:12:14,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:14,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443204372] [2023-11-29 00:12:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:14,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:14,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443204372] [2023-11-29 00:12:14,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443204372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:14,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:14,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:12:14,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126470252] [2023-11-29 00:12:14,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:14,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:12:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:14,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:12:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:12:14,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 00:12:14,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 229 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-29 00:12:14,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:14,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 00:12:14,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:19,563 INFO L124 PetriNetUnfolderBase]: 22737/36475 cut-off events. [2023-11-29 00:12:19,563 INFO L125 PetriNetUnfolderBase]: For 39031/42333 co-relation queries the response was YES. [2023-11-29 00:12:19,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98867 conditions, 36475 events. 22737/36475 cut-off events. For 39031/42333 co-relation queries the response was YES. Maximal size of possible extension queue 1828. Compared 310692 event pairs, 6181 based on Foata normal form. 1699/36197 useless extension candidates. Maximal degree in co-relation 98848. Up to 17498 conditions per place. [2023-11-29 00:12:19,773 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 40 selfloop transitions, 3 changer transitions 47/118 dead transitions. [2023-11-29 00:12:19,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 634 flow [2023-11-29 00:12:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:12:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:12:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2023-11-29 00:12:19,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993603411513859 [2023-11-29 00:12:19,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 328 transitions. [2023-11-29 00:12:19,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 328 transitions. [2023-11-29 00:12:19,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:19,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 328 transitions. [2023-11-29 00:12:19,777 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-29 00:12:19,778 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-29 00:12:19,778 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-29 00:12:19,778 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 229 flow. Second operand 7 states and 328 transitions. [2023-11-29 00:12:19,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 634 flow [2023-11-29 00:12:19,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 572 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-11-29 00:12:19,905 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 214 flow [2023-11-29 00:12:19,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-11-29 00:12:19,906 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 00:12:19,906 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 214 flow [2023-11-29 00:12:19,906 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-29 00:12:19,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:19,906 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] [2023-11-29 00:12:19,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 00:12:19,906 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-29 00:12:19,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2086843631, now seen corresponding path program 1 times [2023-11-29 00:12:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:19,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168995165] [2023-11-29 00:12:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:20,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:20,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168995165] [2023-11-29 00:12:20,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168995165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:20,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:20,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:12:20,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712852798] [2023-11-29 00:12:20,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:20,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:12:20,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:20,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:12:20,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:12:20,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 67 [2023-11-29 00:12:20,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:20,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:20,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 67 [2023-11-29 00:12:20,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:24,754 INFO L124 PetriNetUnfolderBase]: 27159/39976 cut-off events. [2023-11-29 00:12:24,754 INFO L125 PetriNetUnfolderBase]: For 53773/53829 co-relation queries the response was YES. [2023-11-29 00:12:24,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111639 conditions, 39976 events. 27159/39976 cut-off events. For 53773/53829 co-relation queries the response was YES. Maximal size of possible extension queue 1532. Compared 285593 event pairs, 5175 based on Foata normal form. 912/40747 useless extension candidates. Maximal degree in co-relation 111617. Up to 12689 conditions per place. [2023-11-29 00:12:24,991 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 64 selfloop transitions, 9 changer transitions 90/179 dead transitions. [2023-11-29 00:12:24,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 179 transitions, 1022 flow [2023-11-29 00:12:24,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:12:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 00:12:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 439 transitions. [2023-11-29 00:12:24,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.655223880597015 [2023-11-29 00:12:24,994 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 439 transitions. [2023-11-29 00:12:24,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 439 transitions. [2023-11-29 00:12:24,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:24,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 439 transitions. [2023-11-29 00:12:24,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 43.9) internal successors, (439), 10 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:24,999 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-29 00:12:24,999 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-29 00:12:25,000 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 214 flow. Second operand 10 states and 439 transitions. [2023-11-29 00:12:25,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 179 transitions, 1022 flow [2023-11-29 00:12:26,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 179 transitions, 984 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-11-29 00:12:26,078 INFO L231 Difference]: Finished difference. Result has 82 places, 60 transitions, 293 flow [2023-11-29 00:12:26,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=293, PETRI_PLACES=82, PETRI_TRANSITIONS=60} [2023-11-29 00:12:26,079 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-29 00:12:26,079 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 60 transitions, 293 flow [2023-11-29 00:12:26,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:26,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:26,079 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-29 00:12:26,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:12:26,080 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-29 00:12:26,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1043767187, now seen corresponding path program 1 times [2023-11-29 00:12:26,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347178034] [2023-11-29 00:12:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:26,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:26,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347178034] [2023-11-29 00:12:26,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347178034] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:26,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:12:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171190522] [2023-11-29 00:12:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:26,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:12:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:26,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:12:26,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:12:26,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:12:26,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 60 transitions, 293 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-29 00:12:26,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:26,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:12:26,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:32,311 INFO L124 PetriNetUnfolderBase]: 36470/54472 cut-off events. [2023-11-29 00:12:32,311 INFO L125 PetriNetUnfolderBase]: For 51439/65916 co-relation queries the response was YES. [2023-11-29 00:12:32,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134194 conditions, 54472 events. 36470/54472 cut-off events. For 51439/65916 co-relation queries the response was YES. Maximal size of possible extension queue 2136. Compared 412808 event pairs, 6551 based on Foata normal form. 2454/54517 useless extension candidates. Maximal degree in co-relation 134167. Up to 29081 conditions per place. [2023-11-29 00:12:32,649 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 57 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2023-11-29 00:12:32,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 518 flow [2023-11-29 00:12:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:12:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:12:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-29 00:12:32,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-29 00:12:32,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-29 00:12:32,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-29 00:12:32,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:32,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-29 00:12:32,651 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-29 00:12:32,652 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-29 00:12:32,652 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-29 00:12:32,652 INFO L175 Difference]: Start difference. First operand has 82 places, 60 transitions, 293 flow. Second operand 4 states and 194 transitions. [2023-11-29 00:12:32,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 94 transitions, 518 flow [2023-11-29 00:12:33,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 94 transitions, 503 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 00:12:33,169 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 324 flow [2023-11-29 00:12:33,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2023-11-29 00:12:33,170 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-29 00:12:33,170 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 324 flow [2023-11-29 00:12:33,170 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-29 00:12:33,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:33,170 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-29 00:12:33,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:12:33,170 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-29 00:12:33,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1708591675, now seen corresponding path program 1 times [2023-11-29 00:12:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63096040] [2023-11-29 00:12:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63096040] [2023-11-29 00:12:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63096040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:12:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602883043] [2023-11-29 00:12:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:33,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:12:33,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:12:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:12:33,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:12:33,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 324 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-29 00:12:33,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:33,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:12:33,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:38,625 INFO L124 PetriNetUnfolderBase]: 28930/43606 cut-off events. [2023-11-29 00:12:38,625 INFO L125 PetriNetUnfolderBase]: For 29334/38771 co-relation queries the response was YES. [2023-11-29 00:12:38,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115924 conditions, 43606 events. 28930/43606 cut-off events. For 29334/38771 co-relation queries the response was YES. Maximal size of possible extension queue 1720. Compared 324130 event pairs, 4069 based on Foata normal form. 1864/43573 useless extension candidates. Maximal degree in co-relation 115896. Up to 14737 conditions per place. [2023-11-29 00:12:38,889 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 74 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2023-11-29 00:12:38,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 659 flow [2023-11-29 00:12:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:12:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:12:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-29 00:12:38,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-29 00:12:38,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-29 00:12:38,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-29 00:12:38,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:38,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-29 00:12:38,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:38,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:38,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:38,893 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 324 flow. Second operand 5 states and 247 transitions. [2023-11-29 00:12:38,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 659 flow [2023-11-29 00:12:38,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 644 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-11-29 00:12:38,925 INFO L231 Difference]: Finished difference. Result has 79 places, 70 transitions, 377 flow [2023-11-29 00:12:38,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=79, PETRI_TRANSITIONS=70} [2023-11-29 00:12:38,926 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2023-11-29 00:12:38,926 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 70 transitions, 377 flow [2023-11-29 00:12:38,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-29 00:12:38,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:38,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:38,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 00:12:38,927 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-29 00:12:38,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:38,928 INFO L85 PathProgramCache]: Analyzing trace with hash 872904374, now seen corresponding path program 1 times [2023-11-29 00:12:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177888564] [2023-11-29 00:12:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177888564] [2023-11-29 00:12:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177888564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:12:39,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893330291] [2023-11-29 00:12:39,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:39,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:12:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:12:39,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:12:39,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:12:39,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 70 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:39,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:39,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:12:39,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:43,042 INFO L124 PetriNetUnfolderBase]: 22970/34394 cut-off events. [2023-11-29 00:12:43,042 INFO L125 PetriNetUnfolderBase]: For 46168/53813 co-relation queries the response was YES. [2023-11-29 00:12:43,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102719 conditions, 34394 events. 22970/34394 cut-off events. For 46168/53813 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 247578 event pairs, 3191 based on Foata normal form. 1012/33698 useless extension candidates. Maximal degree in co-relation 102692. Up to 11606 conditions per place. [2023-11-29 00:12:43,250 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 89 selfloop transitions, 14 changer transitions 0/134 dead transitions. [2023-11-29 00:12:43,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 134 transitions, 811 flow [2023-11-29 00:12:43,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:12:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:12:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2023-11-29 00:12:43,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:12:43,252 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 298 transitions. [2023-11-29 00:12:43,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 298 transitions. [2023-11-29 00:12:43,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:43,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 298 transitions. [2023-11-29 00:12:43,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:43,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:43,254 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:43,254 INFO L175 Difference]: Start difference. First operand has 79 places, 70 transitions, 377 flow. Second operand 6 states and 298 transitions. [2023-11-29 00:12:43,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 134 transitions, 811 flow [2023-11-29 00:12:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 134 transitions, 791 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-29 00:12:43,279 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 443 flow [2023-11-29 00:12:43,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=443, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2023-11-29 00:12:43,280 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2023-11-29 00:12:43,280 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 443 flow [2023-11-29 00:12:43,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:43,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:43,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:12:43,281 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:12:43,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:43,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1381285439, now seen corresponding path program 1 times [2023-11-29 00:12:43,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:43,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008209551] [2023-11-29 00:12:43,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:44,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:44,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:44,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008209551] [2023-11-29 00:12:44,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008209551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:44,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:12:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012203065] [2023-11-29 00:12:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:44,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:12:44,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:12:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:12:44,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:12:44,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 443 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:44,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:44,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:12:44,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:49,628 INFO L124 PetriNetUnfolderBase]: 23234/40409 cut-off events. [2023-11-29 00:12:49,629 INFO L125 PetriNetUnfolderBase]: For 63045/78576 co-relation queries the response was YES. [2023-11-29 00:12:49,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116307 conditions, 40409 events. 23234/40409 cut-off events. For 63045/78576 co-relation queries the response was YES. Maximal size of possible extension queue 2519. Compared 382626 event pairs, 8015 based on Foata normal form. 1064/36822 useless extension candidates. Maximal degree in co-relation 116278. Up to 12803 conditions per place. [2023-11-29 00:12:49,911 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 86 selfloop transitions, 11 changer transitions 16/163 dead transitions. [2023-11-29 00:12:49,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 163 transitions, 990 flow [2023-11-29 00:12:49,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:12:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 00:12:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 398 transitions. [2023-11-29 00:12:49,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7425373134328358 [2023-11-29 00:12:49,913 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 398 transitions. [2023-11-29 00:12:49,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 398 transitions. [2023-11-29 00:12:49,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:49,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 398 transitions. [2023-11-29 00:12:49,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:49,916 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-29 00:12:49,916 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-29 00:12:49,916 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 443 flow. Second operand 8 states and 398 transitions. [2023-11-29 00:12:49,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 163 transitions, 990 flow [2023-11-29 00:12:50,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 163 transitions, 951 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-29 00:12:50,727 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 505 flow [2023-11-29 00:12:50,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=505, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2023-11-29 00:12:50,727 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-29 00:12:50,727 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 505 flow [2023-11-29 00:12:50,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:50,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:12:50,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:12:50,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:12:50,728 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:12:50,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:12:50,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2108363265, now seen corresponding path program 2 times [2023-11-29 00:12:50,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:12:50,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204626312] [2023-11-29 00:12:50,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:12:50,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:12:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:12:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:50,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:12:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204626312] [2023-11-29 00:12:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204626312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:12:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:12:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:12:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006617237] [2023-11-29 00:12:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:12:50,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:12:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:12:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:12:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:12:50,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:12:50,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 505 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:50,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:12:50,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:12:50,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:12:58,168 INFO L124 PetriNetUnfolderBase]: 40583/60738 cut-off events. [2023-11-29 00:12:58,168 INFO L125 PetriNetUnfolderBase]: For 143131/157722 co-relation queries the response was YES. [2023-11-29 00:12:58,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208002 conditions, 60738 events. 40583/60738 cut-off events. For 143131/157722 co-relation queries the response was YES. Maximal size of possible extension queue 2727. Compared 473292 event pairs, 4229 based on Foata normal form. 752/59067 useless extension candidates. Maximal degree in co-relation 207970. Up to 22906 conditions per place. [2023-11-29 00:12:58,534 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 95 selfloop transitions, 18 changer transitions 12/156 dead transitions. [2023-11-29 00:12:58,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 156 transitions, 1136 flow [2023-11-29 00:12:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:12:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:12:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2023-11-29 00:12:58,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697228144989339 [2023-11-29 00:12:58,536 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 327 transitions. [2023-11-29 00:12:58,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 327 transitions. [2023-11-29 00:12:58,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:12:58,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 327 transitions. [2023-11-29 00:12:58,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:12:58,538 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-29 00:12:58,538 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-29 00:12:58,538 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 505 flow. Second operand 7 states and 327 transitions. [2023-11-29 00:12:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 156 transitions, 1136 flow [2023-11-29 00:13:02,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 156 transitions, 1094 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-29 00:13:02,154 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 510 flow [2023-11-29 00:13:02,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=510, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2023-11-29 00:13:02,155 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-29 00:13:02,155 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 510 flow [2023-11-29 00:13:02,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:02,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:02,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:02,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:13:02,156 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:13:02,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1798707726, now seen corresponding path program 1 times [2023-11-29 00:13:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909456471] [2023-11-29 00:13:02,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909456471] [2023-11-29 00:13:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909456471] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:02,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:13:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693648628] [2023-11-29 00:13:02,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:13:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:13:02,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:13:02,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 00:13:02,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:02,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:02,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 00:13:02,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:03,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 66#L816true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 257#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 19#L877true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 14#L783true, 70#L845true, 267#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:03,844 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-29 00:13:03,844 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:13:03,844 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:13:03,844 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-29 00:13:04,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 66#L816true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 257#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 19#L877true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 70#L845true, 267#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,137 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-29 00:13:04,138 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:13:04,138 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:13:04,138 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-29 00:13:04,470 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 50#L776true, 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 14#L783true, 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 31#L876-3true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,470 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,470 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,470 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,471 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 66#L816true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 257#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 19#L877true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 70#L845true, 6#L789true, 267#true, 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,525 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,525 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 259#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 19#L877true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 16#P2EXITtrue, 14#L783true, 70#L845true, 267#true, 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,540 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,540 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,540 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,540 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-29 00:13:04,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 50#L776true, 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, 31#L876-3true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,876 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,876 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,876 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,877 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 50#L776true, 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 19#L877true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 14#L783true, 16#P2EXITtrue, 70#L845true, 267#true, 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,887 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,888 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,888 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,888 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 259#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 19#L877true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,929 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,929 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,929 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,929 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 259#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 22#L879true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 14#L783true, 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:04,937 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,937 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,937 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:04,937 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-29 00:13:05,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 50#L776true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 19#L877true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,276 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,276 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,276 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,276 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,281 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 50#L776true, 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 31#L876-3true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,281 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,281 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,281 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,281 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 51#P0EXITtrue, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 19#L877true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 14#L783true, 16#P2EXITtrue, 70#L845true, 267#true, 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,285 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,286 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,286 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,286 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 50#L776true, 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 14#L783true, 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,294 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,294 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,294 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,294 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 50#L776true, 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 14#L783true, 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,295 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,295 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,295 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,296 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 259#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 19#L877true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,338 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,338 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,338 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,339 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,340 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 259#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 22#L879true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 16#P2EXITtrue, 70#L845true, 267#true, 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,340 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,340 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,340 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,340 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-29 00:13:05,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 51#P0EXITtrue, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 19#L877true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,858 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,858 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,858 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,858 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 50#L776true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 19#L877true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,874 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,874 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,875 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,875 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 50#L776true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,885 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,885 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,885 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,885 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 50#L776true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,886 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,886 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,886 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,886 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 51#P0EXITtrue, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 14#L783true, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,895 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,895 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,895 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,895 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 259#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), 22#L879true, Black: 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 37#L773true, 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:05,948 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,948 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,948 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:05,948 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-29 00:13:06,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, 51#P0EXITtrue, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 19#L877true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:06,249 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,249 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,249 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,249 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 51#P0EXITtrue, Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), 28#L786true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:06,253 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,253 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,253 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,253 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 50#L776true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:06,272 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,273 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,273 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,273 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, 50#L776true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:06,274 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,274 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,274 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,274 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-29 00:13:06,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([468] L829-->L845: Formula: (let ((.cse11 (= (mod v_~a$r_buff1_thd4~0_62 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_64 256) 0))) (let ((.cse9 (not .cse8)) (.cse2 (and .cse11 .cse8)) (.cse4 (and (= (mod v_~a$w_buff1_used~0_123 256) 0) .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_134 256) 0))) (let ((.cse5 (or .cse2 .cse4 .cse12)) (.cse6 (and .cse9 (not .cse12)))) (let ((.cse0 (ite .cse5 v_~a~0_69 (ite .cse6 v_~a$w_buff0~0_47 v_~a$w_buff1~0_38))) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse3 (= (mod v_~a$w_buff0_used~0_133 256) 0)) (.cse7 (= (mod v_~a$w_buff1_used~0_122 256) 0))) (and (= v_~a$w_buff0~0_47 v_~a$w_buff0~0_46) (= v_~a$flush_delayed~0_31 0) (= v_~a$w_buff1~0_38 v_~a$w_buff1~0_37) (= .cse0 v_~__unbuffered_p3_EBX~0_16) (= v_~a$w_buff1_used~0_122 (ite .cse1 v_~a$w_buff1_used~0_123 (ite (or .cse2 .cse3 .cse4) v_~a$w_buff1_used~0_123 0))) (= v_~a~0_68 (ite .cse1 v_~a$mem_tmp~0_18 .cse0)) (= v_~a~0_69 v_~a$mem_tmp~0_18) (= (ite .cse1 v_~a$w_buff0_used~0_134 (ite .cse5 v_~a$w_buff0_used~0_134 (ite .cse6 0 v_~a$w_buff0_used~0_134))) v_~a$w_buff0_used~0_133) (= v_~a$r_buff0_thd4~0_63 (ite .cse1 v_~a$r_buff0_thd4~0_64 (ite (or (and .cse7 .cse8) .cse2 .cse3) v_~a$r_buff0_thd4~0_64 (ite (and .cse9 (not .cse3)) 0 v_~a$r_buff0_thd4~0_64)))) (= v_~a$r_buff1_thd4~0_61 (ite .cse1 v_~a$r_buff1_thd4~0_62 (ite (let ((.cse10 (= (mod v_~a$r_buff0_thd4~0_63 256) 0))) (or (and .cse10 .cse11) .cse3 (and .cse7 .cse10))) v_~a$r_buff1_thd4~0_62 0)))))))) InVars {~a~0=v_~a~0_69, ~a$w_buff1~0=v_~a$w_buff1~0_38, ~a$w_buff0~0=v_~a$w_buff0~0_47, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_62, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_134, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_123, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_64} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_61, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_133, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_63, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_68, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_37, ~a$flush_delayed~0=v_~a$flush_delayed~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_46, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][62], [Black: 195#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 197#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 255#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork3InUse, Black: 263#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), 166#true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, Black: 135#(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 (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 51#P0EXITtrue, Black: 133#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 129#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 124#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t603~0#1.base| 0) |ULTIMATE.start_main_~#t604~0#1.base| 0) |ULTIMATE.start_main_~#t601~0#1.base| 0) |ULTIMATE.start_main_~#t602~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t604~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t601~0#1.base|)) (not (= |ULTIMATE.start_main_~#t602~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t601~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|)) (not (= |ULTIMATE.start_main_~#t604~0#1.base| |ULTIMATE.start_main_~#t603~0#1.base|))), Black: 209#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 22#L879true, 261#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 205#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 224#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 16#P2EXITtrue, 70#L845true, 6#L789true, 267#true, Black: 231#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$w_buff1~0 0) (= ~a$r_buff0_thd1~0 1)), Black: 238#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 232#(and (not (= ~a$w_buff0~0 0)) (= ~a$r_buff1_thd4~0 0) (= ~a$w_buff1_used~0 0) (= ~a~0 ~a$w_buff0~0) (= ~a$w_buff1~0 0) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2023-11-29 00:13:06,609 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-29 00:13:06,609 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:13:06,609 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:13:06,609 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-29 00:13:08,130 INFO L124 PetriNetUnfolderBase]: 28164/49438 cut-off events. [2023-11-29 00:13:08,130 INFO L125 PetriNetUnfolderBase]: For 110825/123041 co-relation queries the response was YES. [2023-11-29 00:13:08,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160274 conditions, 49438 events. 28164/49438 cut-off events. For 110825/123041 co-relation queries the response was YES. Maximal size of possible extension queue 3285. Compared 497150 event pairs, 10441 based on Foata normal form. 638/44385 useless extension candidates. Maximal degree in co-relation 160244. Up to 17669 conditions per place. [2023-11-29 00:13:08,458 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 53 selfloop transitions, 6 changer transitions 16/120 dead transitions. [2023-11-29 00:13:08,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 120 transitions, 833 flow [2023-11-29 00:13:08,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:13:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:13:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2023-11-29 00:13:08,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6746268656716418 [2023-11-29 00:13:08,460 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 226 transitions. [2023-11-29 00:13:08,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 226 transitions. [2023-11-29 00:13:08,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:08,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 226 transitions. [2023-11-29 00:13:08,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:08,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:08,463 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:08,463 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 510 flow. Second operand 5 states and 226 transitions. [2023-11-29 00:13:08,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 120 transitions, 833 flow [2023-11-29 00:13:11,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 120 transitions, 742 flow, removed 34 selfloop flow, removed 7 redundant places. [2023-11-29 00:13:11,711 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 473 flow [2023-11-29 00:13:11,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=473, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2023-11-29 00:13:11,711 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-11-29 00:13:11,711 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 473 flow [2023-11-29 00:13:11,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:11,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:11,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:11,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:13:11,712 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:13:11,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:11,712 INFO L85 PathProgramCache]: Analyzing trace with hash 907051818, now seen corresponding path program 2 times [2023-11-29 00:13:11,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:11,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479095181] [2023-11-29 00:13:11,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:11,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479095181] [2023-11-29 00:13:11,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479095181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:11,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:11,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:13:11,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663433667] [2023-11-29 00:13:11,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:11,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:13:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:11,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:13:11,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:13:11,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-29 00:13:11,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 473 flow. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:11,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:11,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-29 00:13:11,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:19,494 INFO L124 PetriNetUnfolderBase]: 40166/69162 cut-off events. [2023-11-29 00:13:19,494 INFO L125 PetriNetUnfolderBase]: For 127698/143692 co-relation queries the response was YES. [2023-11-29 00:13:19,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204700 conditions, 69162 events. 40166/69162 cut-off events. For 127698/143692 co-relation queries the response was YES. Maximal size of possible extension queue 5231. Compared 711121 event pairs, 10328 based on Foata normal form. 2128/63548 useless extension candidates. Maximal degree in co-relation 204671. Up to 23208 conditions per place. [2023-11-29 00:13:19,863 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 67 selfloop transitions, 4 changer transitions 16/136 dead transitions. [2023-11-29 00:13:19,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 136 transitions, 883 flow [2023-11-29 00:13:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:13:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:13:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2023-11-29 00:13:19,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 00:13:19,864 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 268 transitions. [2023-11-29 00:13:19,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 268 transitions. [2023-11-29 00:13:19,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:19,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 268 transitions. [2023-11-29 00:13:19,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.666666666666664) internal successors, (268), 6 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-29 00:13:19,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:19,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:19,866 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 473 flow. Second operand 6 states and 268 transitions. [2023-11-29 00:13:19,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 136 transitions, 883 flow [2023-11-29 00:13:27,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 136 transitions, 871 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 00:13:27,122 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 490 flow [2023-11-29 00:13:27,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2023-11-29 00:13:27,122 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 20 predicate places. [2023-11-29 00:13:27,123 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 490 flow [2023-11-29 00:13:27,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:27,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:13:27,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:13:27,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:13:27,123 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:13:27,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:13:27,123 INFO L85 PathProgramCache]: Analyzing trace with hash 671072960, now seen corresponding path program 3 times [2023-11-29 00:13:27,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:13:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727673800] [2023-11-29 00:13:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:13:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:13:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:13:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:13:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:13:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727673800] [2023-11-29 00:13:27,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727673800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:13:27,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:13:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 00:13:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757396171] [2023-11-29 00:13:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:13:27,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:13:27,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:13:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:13:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:13:27,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:13:27,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 490 flow. Second operand has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:27,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:13:27,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:13:27,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:13:39,246 INFO L124 PetriNetUnfolderBase]: 57195/99637 cut-off events. [2023-11-29 00:13:39,246 INFO L125 PetriNetUnfolderBase]: For 176271/203249 co-relation queries the response was YES. [2023-11-29 00:13:39,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289294 conditions, 99637 events. 57195/99637 cut-off events. For 176271/203249 co-relation queries the response was YES. Maximal size of possible extension queue 8681. Compared 1107513 event pairs, 9583 based on Foata normal form. 2362/88997 useless extension candidates. Maximal degree in co-relation 289263. Up to 33852 conditions per place. [2023-11-29 00:13:39,880 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 81 selfloop transitions, 17 changer transitions 16/168 dead transitions. [2023-11-29 00:13:39,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 168 transitions, 1040 flow [2023-11-29 00:13:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 00:13:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 00:13:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 470 transitions. [2023-11-29 00:13:39,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7014925373134329 [2023-11-29 00:13:39,883 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 470 transitions. [2023-11-29 00:13:39,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 470 transitions. [2023-11-29 00:13:39,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:13:39,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 470 transitions. [2023-11-29 00:13:39,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 47.0) internal successors, (470), 10 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:13:39,886 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-29 00:13:39,886 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-29 00:13:39,887 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 490 flow. Second operand 10 states and 470 transitions. [2023-11-29 00:13:39,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 168 transitions, 1040 flow [2023-11-29 00:14:05,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 168 transitions, 1033 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 00:14:05,267 INFO L231 Difference]: Finished difference. Result has 104 places, 96 transitions, 619 flow [2023-11-29 00:14:05,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=619, PETRI_PLACES=104, PETRI_TRANSITIONS=96} [2023-11-29 00:14:05,268 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 30 predicate places. [2023-11-29 00:14:05,268 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 96 transitions, 619 flow [2023-11-29 00:14:05,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.22222222222222) internal successors, (344), 9 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:05,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:05,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:05,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:14:05,269 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:05,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1476727764, now seen corresponding path program 4 times [2023-11-29 00:14:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:14:05,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905987075] [2023-11-29 00:14:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:14:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:14:05,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:14:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:14:05,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:14:05,427 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:14:05,427 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 00:14:05,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 00:14:05,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 00:14:05,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 00:14:05,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 00:14:05,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 00:14:05,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 00:14:05,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 00:14:05,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 00:14:05,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 00:14:05,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 00:14:05,432 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:05,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:14:05,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:14:05,510 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:14:05,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:14:05,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:14:05,514 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:14:05,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:14:05,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:14:05,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:14:05 BasicIcfg [2023-11-29 00:14:05,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:14:05,546 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:14:05,546 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:14:05,546 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:14:05,547 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:11:57" (3/4) ... [2023-11-29 00:14:05,548 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:14:05,549 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:14:05,550 INFO L158 Benchmark]: Toolchain (without parser) took 129096.39ms. Allocated memory was 127.9MB in the beginning and 9.9GB in the end (delta: 9.7GB). Free memory was 89.8MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2023-11-29 00:14:05,550 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:14:05,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.93ms. Allocated memory is still 127.9MB. Free memory was 89.3MB in the beginning and 65.0MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 00:14:05,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.08ms. Allocated memory is still 127.9MB. Free memory was 65.0MB in the beginning and 62.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:14:05,551 INFO L158 Benchmark]: Boogie Preprocessor took 57.54ms. Allocated memory is still 127.9MB. Free memory was 62.5MB in the beginning and 58.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:14:05,552 INFO L158 Benchmark]: RCFGBuilder took 782.21ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 58.7MB in the beginning and 83.2MB in the end (delta: -24.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-11-29 00:14:05,552 INFO L158 Benchmark]: TraceAbstraction took 127646.32ms. Allocated memory was 155.2MB in the beginning and 9.9GB in the end (delta: 9.7GB). Free memory was 82.2MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. [2023-11-29 00:14:05,552 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 9.9GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:14:05,554 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.93ms. Allocated memory is still 127.9MB. Free memory was 89.3MB in the beginning and 65.0MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.08ms. Allocated memory is still 127.9MB. Free memory was 65.0MB in the beginning and 62.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.54ms. Allocated memory is still 127.9MB. Free memory was 62.5MB in the beginning and 58.7MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 782.21ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 58.7MB in the beginning and 83.2MB in the end (delta: -24.4MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 127646.32ms. Allocated memory was 155.2MB in the beginning and 9.9GB in the end (delta: 9.7GB). Free memory was 82.2MB in the beginning and 5.4GB in the end (delta: -5.3GB). Peak memory consumption was 4.4GB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 9.9GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L17] 0 __assert_fail ("0", "mix023_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 127.4s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 122.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1341 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1163 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3483 IncrementalHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 74 mSDtfsCounter, 3483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=619occurred in iteration=21, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 2756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:14:05,577 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:14:07,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:14:08,017 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 00:14:08,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:14:08,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:14:08,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:14:08,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:14:08,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:14:08,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:14:08,065 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:14:08,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:14:08,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:14:08,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:14:08,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:14:08,069 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:14:08,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:14:08,070 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:14:08,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:14:08,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:14:08,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:14:08,072 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 00:14:08,075 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 00:14:08,075 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 00:14:08,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:14:08,076 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:14:08,076 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:14:08,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:14:08,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:14:08,077 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:14:08,078 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:14:08,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:14:08,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:14:08,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:14:08,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:14:08,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:14:08,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:14:08,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:14:08,080 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:14:08,081 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:14:08,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:14:08,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:14:08,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:14:08,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:14:08,082 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:14:08,082 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_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b51bd5b35703bd543bead4074e6d14da7b357845ee956f8678aa2abe4dcc1210 [2023-11-29 00:14:08,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:14:08,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:14:08,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:14:08,404 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:14:08,405 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:14:08,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 00:14:11,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:14:11,436 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:14:11,437 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/sv-benchmarks/c/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 00:14:11,452 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data/9fbad8d12/f6dc435f20774228b6374ca9e59e21d7/FLAG9f5ee36d7 [2023-11-29 00:14:11,465 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/data/9fbad8d12/f6dc435f20774228b6374ca9e59e21d7 [2023-11-29 00:14:11,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:14:11,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:14:11,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:14:11,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:14:11,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:14:11,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:14:11" (1/1) ... [2023-11-29 00:14:11,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ace7e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:11, skipping insertion in model container [2023-11-29 00:14:11,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:14:11" (1/1) ... [2023-11-29 00:14:11,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:14:11,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:14:11,879 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:14:11,950 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:14:12,017 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:14:12,018 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 00:14:12,026 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:14:12,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12 WrapperNode [2023-11-29 00:14:12,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:14:12,028 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:14:12,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:14:12,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:14:12,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,081 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-29 00:14:12,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:14:12,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:14:12,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:14:12,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:14:12,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,119 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-29 00:14:12,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:14:12,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:14:12,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:14:12,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:14:12,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (1/1) ... [2023-11-29 00:14:12,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:14:12,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:14:12,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:14:12,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:14:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 00:14:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:14:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 00:14:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 00:14:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 00:14:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 00:14:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 00:14:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 00:14:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 00:14:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:14:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 00:14:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 00:14:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 00:14:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 00:14:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 00:14:12,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 00:14:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 00:14:12,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 00:14:12,230 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 00:14:12,230 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 00:14:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 00:14:12,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 00:14:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 00:14:12,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:14:12,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:14:12,233 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 00:14:12,399 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:14:12,401 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:14:12,802 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:14:13,016 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:14:13,016 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 00:14:13,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:14:13 BoogieIcfgContainer [2023-11-29 00:14:13,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:14:13,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:14:13,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:14:13,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:14:13,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:14:11" (1/3) ... [2023-11-29 00:14:13,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e65b0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:14:13, skipping insertion in model container [2023-11-29 00:14:13,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:14:12" (2/3) ... [2023-11-29 00:14:13,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e65b0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:14:13, skipping insertion in model container [2023-11-29 00:14:13,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:14:13" (3/3) ... [2023-11-29 00:14:13,024 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 00:14:13,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:14:13,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 00:14:13,038 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 00:14:13,105 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 00:14:13,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 00:14:13,168 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-29 00:14:13,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:14:13,172 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 136 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-29 00:14:13,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-29 00:14:13,176 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-29 00:14:13,186 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:14:13,192 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;@2070e270, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:14:13,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 00:14:13,196 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 00:14:13,197 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 00:14:13,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 00:14:13,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:13,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:14:13,198 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-29 00:14:13,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:13,203 INFO L85 PathProgramCache]: Analyzing trace with hash 14327, now seen corresponding path program 1 times [2023-11-29 00:14:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:13,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943209806] [2023-11-29 00:14:13,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:13,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:13,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:13,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:13,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 00:14:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:13,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:14:13,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:13,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:14:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:13,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:13,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943209806] [2023-11-29 00:14:13,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943209806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:13,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:14:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967939919] [2023-11-29 00:14:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:13,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:13,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:14:13,509 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-29 00:14:13,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:13,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:14:13,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:14,903 INFO L124 PetriNetUnfolderBase]: 4217/7243 cut-off events. [2023-11-29 00:14:14,903 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 00:14:14,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13170 conditions, 7243 events. 4217/7243 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54851 event pairs, 3179 based on Foata normal form. 360/6976 useless extension candidates. Maximal degree in co-relation 13155. Up to 4391 conditions per place. [2023-11-29 00:14:14,985 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-29 00:14:14,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-29 00:14:14,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:14:14,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:14:14,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:14:14,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:14:15,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:15,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:14:15,006 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-29 00:14:15,010 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-29 00:14:15,011 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-29 00:14:15,013 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:14:15,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-29 00:14:15,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 00:14:15,024 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-29 00:14:15,026 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-29 00:14:15,029 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-29 00:14:15,030 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-29 00:14:15,030 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-29 00:14:15,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:15,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 00:14:15,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:14:15,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:15,231 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-29 00:14:15,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 14328, now seen corresponding path program 1 times [2023-11-29 00:14:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:15,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751464991] [2023-11-29 00:14:15,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:15,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:15,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 00:14:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:15,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:14:15,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:15,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:14:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:15,345 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:15,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751464991] [2023-11-29 00:14:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751464991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:15,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:15,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:14:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113545262] [2023-11-29 00:14:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:15,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:15,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:15,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:15,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:14:15,399 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-29 00:14:15,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:15,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:14:15,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:16,462 INFO L124 PetriNetUnfolderBase]: 4217/7242 cut-off events. [2023-11-29 00:14:16,462 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 00:14:16,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13346 conditions, 7242 events. 4217/7242 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54903 event pairs, 3179 based on Foata normal form. 1/6616 useless extension candidates. Maximal degree in co-relation 13335. Up to 4390 conditions per place. [2023-11-29 00:14:16,515 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 00:14:16,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-29 00:14:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:14:16,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:14:16,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:14:16,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:14:16,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:16,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:14:16,520 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-29 00:14:16,521 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-29 00:14:16,521 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-29 00:14:16,521 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:14:16,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-29 00:14:16,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:16,531 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 00:14:16,532 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-29 00:14:16,533 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-29 00:14:16,533 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 00:14:16,533 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-29 00:14:16,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:16,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:14:16,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 00:14:16,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:16,734 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-29 00:14:16,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 427254972, now seen corresponding path program 1 times [2023-11-29 00:14:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:16,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818219529] [2023-11-29 00:14:16,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:16,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:16,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:16,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:16,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 00:14:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:16,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:14:16,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:16,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:14:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:16,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:16,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:16,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818219529] [2023-11-29 00:14:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818219529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214468101] [2023-11-29 00:14:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:16,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:16,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:14:16,874 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-29 00:14:16,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:16,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:14:16,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:17,844 INFO L124 PetriNetUnfolderBase]: 4221/7205 cut-off events. [2023-11-29 00:14:17,844 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 00:14:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13318 conditions, 7205 events. 4221/7205 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 54495 event pairs, 3251 based on Foata normal form. 0/6588 useless extension candidates. Maximal degree in co-relation 13307. Up to 4393 conditions per place. [2023-11-29 00:14:17,910 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 00:14:17,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-29 00:14:17,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-29 00:14:17,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 00:14:17,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-29 00:14:17,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-29 00:14:17,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:17,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-29 00:14:17,914 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-29 00:14:17,915 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-29 00:14:17,916 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-29 00:14:17,916 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-29 00:14:17,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-29 00:14:17,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:17,924 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 00:14:17,924 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-29 00:14:17,925 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 00:14:17,925 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 00:14:17,925 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-29 00:14:17,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:17,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:14:17,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-29 00:14:18,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:18,127 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-29 00:14:18,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 427254973, now seen corresponding path program 1 times [2023-11-29 00:14:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364337413] [2023-11-29 00:14:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:18,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:18,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 00:14:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:18,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:14:18,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:18,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:14:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:18,254 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:18,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:18,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364337413] [2023-11-29 00:14:18,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364337413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213467269] [2023-11-29 00:14:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:18,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:18,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:14:18,307 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-29 00:14:18,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:18,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:14:18,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:19,505 INFO L124 PetriNetUnfolderBase]: 4217/7232 cut-off events. [2023-11-29 00:14:19,505 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 00:14:19,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13340 conditions, 7232 events. 4217/7232 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 55189 event pairs, 2503 based on Foata normal form. 5/6623 useless extension candidates. Maximal degree in co-relation 13330. Up to 4384 conditions per place. [2023-11-29 00:14:19,561 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 00:14:19,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 00:14:19,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-29 00:14:19,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-29 00:14:19,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-29 00:14:19,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-29 00:14:19,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:19,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-29 00:14:19,564 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-29 00:14:19,566 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-29 00:14:19,566 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-29 00:14:19,566 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-29 00:14:19,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 00:14:19,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:19,570 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 00:14:19,570 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-29 00:14:19,571 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-29 00:14:19,571 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 00:14:19,572 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-29 00:14:19,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:19,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 00:14:19,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 00:14:19,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:19,773 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-29 00:14:19,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash 427256646, now seen corresponding path program 1 times [2023-11-29 00:14:19,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:19,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428531970] [2023-11-29 00:14:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:19,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:19,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:14:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:19,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:14:19,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:19,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:19,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:19,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428531970] [2023-11-29 00:14:19,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428531970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:19,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:19,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:14:19,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481310504] [2023-11-29 00:14:19,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:19,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:19,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:19,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:19,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:19,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-29 00:14:19,870 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-29 00:14:19,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:19,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-29 00:14:19,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:20,508 INFO L124 PetriNetUnfolderBase]: 3311/5477 cut-off events. [2023-11-29 00:14:20,508 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 00:14:20,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10302 conditions, 5477 events. 3311/5477 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 40228 event pairs, 593 based on Foata normal form. 0/5402 useless extension candidates. Maximal degree in co-relation 10292. Up to 3661 conditions per place. [2023-11-29 00:14:20,541 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-29 00:14:20,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-29 00:14:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-29 00:14:20,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-29 00:14:20,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-29 00:14:20,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-29 00:14:20,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:20,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-29 00:14:20,544 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-29 00:14:20,545 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-29 00:14:20,545 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-29 00:14:20,545 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-29 00:14:20,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-29 00:14:20,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:20,549 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-29 00:14:20,549 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-29 00:14:20,550 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-29 00:14:20,550 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-29 00:14:20,550 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-29 00:14:20,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:20,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:20,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 00:14:20,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:20,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:20,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:20,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1929751343, now seen corresponding path program 1 times [2023-11-29 00:14:20,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:20,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615909934] [2023-11-29 00:14:20,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:20,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:20,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:20,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:20,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 00:14:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:20,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:14:20,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:20,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:14:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:20,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:20,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615909934] [2023-11-29 00:14:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615909934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:20,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:20,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757148677] [2023-11-29 00:14:20,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:20,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:20,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:20,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:20,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:14:20,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 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-29 00:14:20,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:20,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:14:20,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:21,442 INFO L124 PetriNetUnfolderBase]: 2903/5160 cut-off events. [2023-11-29 00:14:21,442 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2023-11-29 00:14:21,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9564 conditions, 5160 events. 2903/5160 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 38208 event pairs, 1356 based on Foata normal form. 12/4949 useless extension candidates. Maximal degree in co-relation 9553. Up to 3431 conditions per place. [2023-11-29 00:14:21,464 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 00:14:21,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 208 flow [2023-11-29 00:14:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 00:14:21,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 00:14:21,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 00:14:21,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 00:14:21,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:21,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 00:14:21,467 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-29 00:14:21,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-29 00:14:21,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-29 00:14:21,468 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 146 transitions. [2023-11-29 00:14:21,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 208 flow [2023-11-29 00:14:21,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:21,470 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 00:14:21,470 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-29 00:14:21,471 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 00:14:21,471 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 00:14:21,472 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-29 00:14:21,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:21,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:21,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 00:14:21,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:21,673 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:21,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:21,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1929751344, now seen corresponding path program 1 times [2023-11-29 00:14:21,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116137264] [2023-11-29 00:14:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:21,675 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:21,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 00:14:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:21,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:14:21,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:21,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:14:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:21,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:21,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116137264] [2023-11-29 00:14:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116137264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319776538] [2023-11-29 00:14:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:21,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:21,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:14:21,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 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-29 00:14:21,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:21,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:14:21,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:22,291 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 00:14:22,292 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 00:14:22,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9431 conditions, 5121 events. 2920/5121 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 37694 event pairs, 1892 based on Foata normal form. 0/4902 useless extension candidates. Maximal degree in co-relation 9421. Up to 3460 conditions per place. [2023-11-29 00:14:22,319 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 00:14:22,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-29 00:14:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 00:14:22,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 00:14:22,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 00:14:22,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 00:14:22,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:22,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 00:14:22,322 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-29 00:14:22,322 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-29 00:14:22,323 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-29 00:14:22,323 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 144 transitions. [2023-11-29 00:14:22,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-29 00:14:22,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:22,325 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 00:14:22,325 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-29 00:14:22,326 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-29 00:14:22,326 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 00:14:22,326 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-29 00:14:22,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:22,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:22,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 00:14:22,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:22,527 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-29 00:14:22,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:22,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1084589796, now seen corresponding path program 1 times [2023-11-29 00:14:22,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051444589] [2023-11-29 00:14:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:22,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:22,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:22,529 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:22,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 00:14:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:22,636 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:14:22,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:22,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 00:14:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:22,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:22,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:22,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051444589] [2023-11-29 00:14:22,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051444589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:22,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861644486] [2023-11-29 00:14:22,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:22,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:22,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:22,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:22,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-29 00:14:22,683 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-29 00:14:22,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:22,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-29 00:14:22,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:23,373 INFO L124 PetriNetUnfolderBase]: 2978/5127 cut-off events. [2023-11-29 00:14:23,374 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 00:14:23,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9519 conditions, 5127 events. 2978/5127 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 37057 event pairs, 1424 based on Foata normal form. 0/4980 useless extension candidates. Maximal degree in co-relation 9509. Up to 3426 conditions per place. [2023-11-29 00:14:23,400 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 00:14:23,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-29 00:14:23,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-29 00:14:23,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-29 00:14:23,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-29 00:14:23,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-29 00:14:23,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:23,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-29 00:14:23,403 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-29 00:14:23,403 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-29 00:14:23,404 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-29 00:14:23,404 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-29 00:14:23,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-29 00:14:23,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:23,407 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 00:14:23,407 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-29 00:14:23,408 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-29 00:14:23,408 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 00:14:23,408 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-29 00:14:23,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:23,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:23,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 00:14:23,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:23,609 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-29 00:14:23,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1084589795, now seen corresponding path program 1 times [2023-11-29 00:14:23,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42847389] [2023-11-29 00:14:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:23,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:23,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:23,611 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:23,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 00:14:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:23,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:14:23,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:23,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 00:14:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:23,728 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:23,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:23,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42847389] [2023-11-29 00:14:23,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42847389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:23,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:23,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:14:23,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554978916] [2023-11-29 00:14:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:14:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:14:23,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:14:23,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:14:23,771 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-29 00:14:23,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:23,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:14:23,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:24,425 INFO L124 PetriNetUnfolderBase]: 2903/5076 cut-off events. [2023-11-29 00:14:24,425 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 00:14:24,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9381 conditions, 5076 events. 2903/5076 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 37215 event pairs, 920 based on Foata normal form. 36/4977 useless extension candidates. Maximal degree in co-relation 9371. Up to 3315 conditions per place. [2023-11-29 00:14:24,453 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 00:14:24,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 00:14:24,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:14:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 00:14:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 00:14:24,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-29 00:14:24,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 00:14:24,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 00:14:24,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:24,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 00:14:24,455 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-29 00:14:24,456 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-29 00:14:24,456 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-29 00:14:24,456 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-29 00:14:24,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 00:14:24,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:24,458 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 00:14:24,458 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-29 00:14:24,459 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-29 00:14:24,459 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 00:14:24,459 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-29 00:14:24,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:24,459 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-29 00:14:24,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 00:14:24,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:24,660 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-29 00:14:24,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:24,660 INFO L85 PathProgramCache]: Analyzing trace with hash 78974700, now seen corresponding path program 1 times [2023-11-29 00:14:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906738751] [2023-11-29 00:14:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:24,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:24,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:24,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:24,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 00:14:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:24,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 00:14:24,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:24,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:24,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:24,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906738751] [2023-11-29 00:14:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906738751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:14:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667382117] [2023-11-29 00:14:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:24,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:14:24,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:24,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:14:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:14:24,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:14:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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-29 00:14:24,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:24,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:14:24,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:26,203 INFO L124 PetriNetUnfolderBase]: 9971/15476 cut-off events. [2023-11-29 00:14:26,204 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 00:14:26,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29701 conditions, 15476 events. 9971/15476 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 113449 event pairs, 1033 based on Foata normal form. 400/15720 useless extension candidates. Maximal degree in co-relation 29691. Up to 8761 conditions per place. [2023-11-29 00:14:26,273 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 54 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2023-11-29 00:14:26,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 306 flow [2023-11-29 00:14:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:14:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 00:14:26,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2023-11-29 00:14:26,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7276119402985075 [2023-11-29 00:14:26,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 195 transitions. [2023-11-29 00:14:26,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 195 transitions. [2023-11-29 00:14:26,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:26,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 195 transitions. [2023-11-29 00:14:26,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:26,276 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-29 00:14:26,276 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-29 00:14:26,276 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 4 states and 195 transitions. [2023-11-29 00:14:26,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 306 flow [2023-11-29 00:14:26,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:26,284 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-29 00:14:26,284 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=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-29 00:14:26,285 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-29 00:14:26,285 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-29 00:14:26,285 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-29 00:14:26,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:26,285 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] [2023-11-29 00:14:26,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 00:14:26,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:26,486 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:26,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:26,486 INFO L85 PathProgramCache]: Analyzing trace with hash -767482925, now seen corresponding path program 1 times [2023-11-29 00:14:26,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:26,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486062656] [2023-11-29 00:14:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:26,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:26,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:26,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:26,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 00:14:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:26,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:14:26,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:26,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:26,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:26,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486062656] [2023-11-29 00:14:26,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486062656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:26,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:26,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:14:26,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328084190] [2023-11-29 00:14:26,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:26,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:14:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:14:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:14:26,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:14:26,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:26,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:26,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:14:26,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:27,747 INFO L124 PetriNetUnfolderBase]: 7427/11576 cut-off events. [2023-11-29 00:14:27,748 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-29 00:14:27,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25504 conditions, 11576 events. 7427/11576 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 80664 event pairs, 451 based on Foata normal form. 364/11813 useless extension candidates. Maximal degree in co-relation 25491. Up to 5521 conditions per place. [2023-11-29 00:14:27,793 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 10 changer transitions 1/101 dead transitions. [2023-11-29 00:14:27,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 433 flow [2023-11-29 00:14:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:14:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:14:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-29 00:14:27,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-29 00:14:27,795 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-29 00:14:27,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-29 00:14:27,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:27,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-29 00:14:27,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:27,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:27,797 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:27,797 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 247 transitions. [2023-11-29 00:14:27,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 433 flow [2023-11-29 00:14:27,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 00:14:27,802 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-29 00:14:27,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-29 00:14:27,803 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-29 00:14:27,803 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-29 00:14:27,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:27,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:27,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:27,806 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 00:14:28,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:28,004 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:28,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -395737058, now seen corresponding path program 1 times [2023-11-29 00:14:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:28,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378037501] [2023-11-29 00:14:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:28,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:28,006 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:28,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 00:14:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:28,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:14:28,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:28,182 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:28,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378037501] [2023-11-29 00:14:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378037501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:28,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:28,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:28,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392670845] [2023-11-29 00:14:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:28,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:14:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:14:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:28,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:14:28,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:28,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:28,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:14:28,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:28,964 INFO L124 PetriNetUnfolderBase]: 4491/6892 cut-off events. [2023-11-29 00:14:28,964 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-29 00:14:28,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17126 conditions, 6892 events. 4491/6892 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 41745 event pairs, 289 based on Foata normal form. 244/7020 useless extension candidates. Maximal degree in co-relation 17111. Up to 1969 conditions per place. [2023-11-29 00:14:28,996 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 82 selfloop transitions, 14 changer transitions 1/118 dead transitions. [2023-11-29 00:14:28,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 564 flow [2023-11-29 00:14:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:28,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:14:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2023-11-29 00:14:28,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7388059701492538 [2023-11-29 00:14:28,999 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 297 transitions. [2023-11-29 00:14:28,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 297 transitions. [2023-11-29 00:14:28,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:28,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 297 transitions. [2023-11-29 00:14:29,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:29,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:29,001 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:29,001 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 297 transitions. [2023-11-29 00:14:29,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 564 flow [2023-11-29 00:14:29,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 534 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 00:14:29,018 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-29 00:14:29,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-29 00:14:29,019 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 00:14:29,019 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-29 00:14:29,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:29,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:29,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:29,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-29 00:14:29,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:29,220 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:29,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 699492061, now seen corresponding path program 1 times [2023-11-29 00:14:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:29,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725425969] [2023-11-29 00:14:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:29,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:29,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:29,222 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:29,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 00:14:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:29,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:14:29,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:29,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:29,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:29,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725425969] [2023-11-29 00:14:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725425969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:14:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111601193] [2023-11-29 00:14:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:29,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:14:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:14:29,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:14:29,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-29 00:14:29,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:29,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:29,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-29 00:14:29,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:30,100 INFO L124 PetriNetUnfolderBase]: 2927/4300 cut-off events. [2023-11-29 00:14:30,100 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2023-11-29 00:14:30,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11823 conditions, 4300 events. 2927/4300 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23098 event pairs, 231 based on Foata normal form. 96/4280 useless extension candidates. Maximal degree in co-relation 11807. Up to 1316 conditions per place. [2023-11-29 00:14:30,120 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 73 selfloop transitions, 18 changer transitions 1/113 dead transitions. [2023-11-29 00:14:30,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 554 flow [2023-11-29 00:14:30,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:14:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:14:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 325 transitions. [2023-11-29 00:14:30,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6929637526652452 [2023-11-29 00:14:30,122 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 325 transitions. [2023-11-29 00:14:30,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 325 transitions. [2023-11-29 00:14:30,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:30,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 325 transitions. [2023-11-29 00:14:30,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:30,124 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-29 00:14:30,125 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-29 00:14:30,125 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 325 transitions. [2023-11-29 00:14:30,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 554 flow [2023-11-29 00:14:30,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 508 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 00:14:30,150 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-29 00:14:30,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 00:14:30,150 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-29 00:14:30,150 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-29 00:14:30,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:30,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:30,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:30,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 00:14:30,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:30,351 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:30,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1372448186, now seen corresponding path program 1 times [2023-11-29 00:14:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890390775] [2023-11-29 00:14:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:30,353 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:30,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 00:14:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:30,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 00:14:30,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:31,311 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t602~0#1.base_63| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t601~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t603~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t604~0#1.base_47| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t601~0#1.base_51| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t602~0#1.base_63| (_ bv1 1)))) (and (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t603~0#1.base_55| (_ bv1 1)) |v_ULTIMATE.start_main_~#t604~0#1.base_47|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t603~0#1.base_55|)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t601~0#1.base_51|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t602~0#1.base_63|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t601~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t602~0#1.base_63| (_ bv0 1)) |v_ULTIMATE.start_main_~#t603~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t604~0#1.base_47| (_ bv0 1)) |c_#valid|))))) is different from true [2023-11-29 00:14:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:31,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:31,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890390775] [2023-11-29 00:14:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890390775] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992666660] [2023-11-29 00:14:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:31,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:14:31,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:14:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 00:14:31,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2023-11-29 00:14:31,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:31,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:31,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2023-11-29 00:14:31,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:31,979 INFO L124 PetriNetUnfolderBase]: 1597/2811 cut-off events. [2023-11-29 00:14:31,980 INFO L125 PetriNetUnfolderBase]: For 1155/1243 co-relation queries the response was YES. [2023-11-29 00:14:31,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6345 conditions, 2811 events. 1597/2811 cut-off events. For 1155/1243 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17361 event pairs, 559 based on Foata normal form. 16/2649 useless extension candidates. Maximal degree in co-relation 6327. Up to 1876 conditions per place. [2023-11-29 00:14:31,995 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 43 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-11-29 00:14:31,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 412 flow [2023-11-29 00:14:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:14:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 00:14:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-29 00:14:31,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861407249466951 [2023-11-29 00:14:31,996 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-29 00:14:31,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-29 00:14:31,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:31,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-29 00:14:31,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:31,998 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-29 00:14:31,998 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-29 00:14:31,998 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 228 transitions. [2023-11-29 00:14:31,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 412 flow [2023-11-29 00:14:32,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 316 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 00:14:32,005 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 207 flow [2023-11-29 00:14:32,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-11-29 00:14:32,006 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-29 00:14:32,006 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 207 flow [2023-11-29 00:14:32,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:32,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:32,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:32,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 00:14:32,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:32,207 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-29 00:14:32,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1869128158, now seen corresponding path program 1 times [2023-11-29 00:14:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001065526] [2023-11-29 00:14:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:14:32,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:32,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:32,209 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:32,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 00:14:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:14:32,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:14:32,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:32,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:32,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:32,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001065526] [2023-11-29 00:14:32,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001065526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:32,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:32,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:14:32,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081409970] [2023-11-29 00:14:32,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:32,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:14:32,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:32,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:14:32,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:14:32,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-29 00:14:32,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:32,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:32,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-29 00:14:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:33,790 INFO L124 PetriNetUnfolderBase]: 2271/3802 cut-off events. [2023-11-29 00:14:33,790 INFO L125 PetriNetUnfolderBase]: For 1167/1391 co-relation queries the response was YES. [2023-11-29 00:14:33,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9113 conditions, 3802 events. 2271/3802 cut-off events. For 1167/1391 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23927 event pairs, 439 based on Foata normal form. 16/3584 useless extension candidates. Maximal degree in co-relation 9100. Up to 1499 conditions per place. [2023-11-29 00:14:33,810 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-29 00:14:33,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 124 transitions, 582 flow [2023-11-29 00:14:33,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:14:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 00:14:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2023-11-29 00:14:33,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6849087893864013 [2023-11-29 00:14:33,813 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 413 transitions. [2023-11-29 00:14:33,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 413 transitions. [2023-11-29 00:14:33,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:33,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 413 transitions. [2023-11-29 00:14:33,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:33,816 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-29 00:14:33,816 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-29 00:14:33,817 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 207 flow. Second operand 9 states and 413 transitions. [2023-11-29 00:14:33,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 124 transitions, 582 flow [2023-11-29 00:14:33,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 00:14:33,820 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 244 flow [2023-11-29 00:14:33,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-11-29 00:14:33,820 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-29 00:14:33,820 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 244 flow [2023-11-29 00:14:33,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:33,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:33,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:33,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 00:14:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:34,024 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-29 00:14:34,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1640714710, now seen corresponding path program 2 times [2023-11-29 00:14:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:34,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837889601] [2023-11-29 00:14:34,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:14:34,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:34,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:34,026 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:34,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 00:14:34,141 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:14:34,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:14:34,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:14:34,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:34,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:34,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:34,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837889601] [2023-11-29 00:14:34,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837889601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:34,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:34,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:34,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8268455] [2023-11-29 00:14:34,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:34,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:14:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:34,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:14:34,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:14:34,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 00:14:34,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:34,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:34,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 00:14:34,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:34,970 INFO L124 PetriNetUnfolderBase]: 5038/8385 cut-off events. [2023-11-29 00:14:34,970 INFO L125 PetriNetUnfolderBase]: For 3451/3896 co-relation queries the response was YES. [2023-11-29 00:14:34,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20876 conditions, 8385 events. 5038/8385 cut-off events. For 3451/3896 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 59152 event pairs, 2293 based on Foata normal form. 29/7879 useless extension candidates. Maximal degree in co-relation 20859. Up to 3585 conditions per place. [2023-11-29 00:14:35,027 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 67 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2023-11-29 00:14:35,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 546 flow [2023-11-29 00:14:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:14:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:14:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2023-11-29 00:14:35,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6955223880597015 [2023-11-29 00:14:35,029 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 233 transitions. [2023-11-29 00:14:35,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 233 transitions. [2023-11-29 00:14:35,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:35,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 233 transitions. [2023-11-29 00:14:35,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:35,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:35,031 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:35,031 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 244 flow. Second operand 5 states and 233 transitions. [2023-11-29 00:14:35,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 546 flow [2023-11-29 00:14:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 538 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 00:14:35,051 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 320 flow [2023-11-29 00:14:35,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2023-11-29 00:14:35,052 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-29 00:14:35,052 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 320 flow [2023-11-29 00:14:35,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:35,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:35,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:35,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 00:14:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:35,253 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:35,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1046188660, now seen corresponding path program 3 times [2023-11-29 00:14:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004797796] [2023-11-29 00:14:35,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 00:14:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:35,255 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:35,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 00:14:35,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 00:14:35,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:14:35,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:14:35,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:35,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:35,425 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:35,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004797796] [2023-11-29 00:14:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004797796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:14:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979448624] [2023-11-29 00:14:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:35,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:14:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:14:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:14:35,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 00:14:35,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:35,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:35,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 00:14:35,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:36,953 INFO L124 PetriNetUnfolderBase]: 10095/16423 cut-off events. [2023-11-29 00:14:36,953 INFO L125 PetriNetUnfolderBase]: For 7404/8020 co-relation queries the response was YES. [2023-11-29 00:14:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41460 conditions, 16423 events. 10095/16423 cut-off events. For 7404/8020 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 121349 event pairs, 1572 based on Foata normal form. 16/15480 useless extension candidates. Maximal degree in co-relation 41441. Up to 6450 conditions per place. [2023-11-29 00:14:37,083 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 82 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2023-11-29 00:14:37,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 761 flow [2023-11-29 00:14:37,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:14:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 00:14:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-29 00:14:37,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 00:14:37,085 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-29 00:14:37,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-29 00:14:37,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:37,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-29 00:14:37,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:37,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:37,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:37,087 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 320 flow. Second operand 6 states and 276 transitions. [2023-11-29 00:14:37,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 761 flow [2023-11-29 00:14:37,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:14:37,103 INFO L231 Difference]: Finished difference. Result has 90 places, 91 transitions, 507 flow [2023-11-29 00:14:37,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2023-11-29 00:14:37,103 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-11-29 00:14:37,103 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 507 flow [2023-11-29 00:14:37,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:37,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:37,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:37,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-29 00:14:37,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:37,304 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:37,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash 144073864, now seen corresponding path program 4 times [2023-11-29 00:14:37,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:37,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580596966] [2023-11-29 00:14:37,305 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 00:14:37,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:37,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:37,306 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:37,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 00:14:37,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 00:14:37,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:14:37,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:14:37,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:14:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:14:37,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:14:37,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:37,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580596966] [2023-11-29 00:14:37,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580596966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:14:37,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:14:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:14:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316559784] [2023-11-29 00:14:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:14:37,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:14:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:37,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:14:37,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:14:37,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-29 00:14:37,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 507 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:37,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 00:14:37,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-29 00:14:37,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 00:14:40,147 INFO L124 PetriNetUnfolderBase]: 17863/28860 cut-off events. [2023-11-29 00:14:40,148 INFO L125 PetriNetUnfolderBase]: For 17517/18146 co-relation queries the response was YES. [2023-11-29 00:14:40,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74877 conditions, 28860 events. 17863/28860 cut-off events. For 17517/18146 co-relation queries the response was YES. Maximal size of possible extension queue 1824. Compared 234030 event pairs, 6338 based on Foata normal form. 16/26950 useless extension candidates. Maximal degree in co-relation 74854. Up to 11672 conditions per place. [2023-11-29 00:14:40,376 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 82 selfloop transitions, 26 changer transitions 0/145 dead transitions. [2023-11-29 00:14:40,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 1109 flow [2023-11-29 00:14:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:14:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 00:14:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2023-11-29 00:14:40,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-29 00:14:40,377 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 230 transitions. [2023-11-29 00:14:40,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 230 transitions. [2023-11-29 00:14:40,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 00:14:40,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 230 transitions. [2023-11-29 00:14:40,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:40,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:40,379 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:40,379 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 507 flow. Second operand 5 states and 230 transitions. [2023-11-29 00:14:40,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 1109 flow [2023-11-29 00:14:40,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 145 transitions, 1108 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 00:14:40,459 INFO L231 Difference]: Finished difference. Result has 96 places, 116 transitions, 942 flow [2023-11-29 00:14:40,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=942, PETRI_PLACES=96, PETRI_TRANSITIONS=116} [2023-11-29 00:14:40,459 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-11-29 00:14:40,459 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 942 flow [2023-11-29 00:14:40,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:40,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 00:14:40,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:40,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 00:14:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:40,660 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 00:14:40,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:14:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash -336132462, now seen corresponding path program 5 times [2023-11-29 00:14:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:14:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237773756] [2023-11-29 00:14:40,661 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 00:14:40,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:40,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:14:40,662 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 00:14:40,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 00:14:40,831 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 00:14:40,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 00:14:40,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:14:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:14:40,987 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 00:14:40,988 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:14:40,989 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 00:14:40,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 00:14:40,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 00:14:40,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 00:14:40,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-29 00:14:41,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:14:41,193 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:14:41,198 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 00:14:41,198 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:14:41,255 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 00:14:41,258 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 00:14:41,262 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 00:14:41,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 00:14:41,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:14:41,280 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 00:14:41,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:14:41 BasicIcfg [2023-11-29 00:14:41,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:14:41,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:14:41,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:14:41,296 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:14:41,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:14:13" (3/4) ... [2023-11-29 00:14:41,299 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:14:41,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:14:41,300 INFO L158 Benchmark]: Toolchain (without parser) took 29832.14ms. Allocated memory was 88.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 63.9MB in the beginning and 998.6MB in the end (delta: -934.7MB). Peak memory consumption was 691.6MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,301 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 58.7MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:14:41,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.99ms. Allocated memory is still 88.1MB. Free memory was 63.6MB in the beginning and 59.9MB in the end (delta: 3.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.64ms. Allocated memory is still 88.1MB. Free memory was 59.9MB in the beginning and 57.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,302 INFO L158 Benchmark]: Boogie Preprocessor took 64.74ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 53.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,302 INFO L158 Benchmark]: RCFGBuilder took 868.92ms. Allocated memory is still 88.1MB. Free memory was 53.3MB in the beginning and 37.6MB in the end (delta: 15.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,302 INFO L158 Benchmark]: TraceAbstraction took 28275.98ms. Allocated memory was 88.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 37.1MB in the beginning and 999.6MB in the end (delta: -962.5MB). Peak memory consumption was 659.1MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,303 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 1.7GB. Free memory was 999.6MB in the beginning and 998.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:14:41,304 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 58.7MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.99ms. Allocated memory is still 88.1MB. Free memory was 63.6MB in the beginning and 59.9MB in the end (delta: 3.7MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.64ms. Allocated memory is still 88.1MB. Free memory was 59.9MB in the beginning and 57.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.74ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 53.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 868.92ms. Allocated memory is still 88.1MB. Free memory was 53.3MB in the beginning and 37.6MB in the end (delta: 15.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28275.98ms. Allocated memory was 88.1MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 37.1MB in the beginning and 999.6MB in the end (delta: -962.5MB). Peak memory consumption was 659.1MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 1.7GB. Free memory was 999.6MB in the beginning and 998.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t601={19:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={19:0}, t602={-2147483625:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={19:0}, t602={-2147483625:0}, t603={-2147483629:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t601={19:0}, t602={-2147483625:0}, t603={-2147483629:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={19:0}, t602={-2147483625:0}, t603={-2147483629:0}, t604={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={19:0}, t602={-2147483625:0}, t603={-2147483629:0}, t604={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t601={19:0}, t602={-2147483625:0}, t603={-2147483629:0}, t604={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L17] 0 __assert_fail ("0", "mix023_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 785 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2565 IncrementalHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 37 mSDtfsCounter, 2565 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=942occurred in iteration=18, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 369 ConstructedInterpolants, 1 QuantifiedInterpolants, 2799 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2543 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 00:14:41,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1d92c9de-01ab-41af-ab81-14ce436b4dae/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample