./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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_a37da928-d70f-41d2-a4ee-4579cd04da65/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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:25:52,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:25:52,168 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:25:52,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:25:52,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:25:52,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:25:52,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:25:52,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:25:52,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:25:52,196 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:25:52,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:25:52,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:25:52,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:25:52,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:25:52,199 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:25:52,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:25:52,200 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:25:52,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:25:52,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:25:52,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:25:52,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:25:52,203 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:25:52,203 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:25:52,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:25:52,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:25:52,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:25:52,205 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:25:52,205 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:25:52,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:25:52,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:25:52,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:25:52,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:25:52,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:25:52,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:25:52,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:25:52,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:25:52,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:25:52,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:25:52,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:25:52,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:25:52,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:25:52,209 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_a37da928-d70f-41d2-a4ee-4579cd04da65/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_a37da928-d70f-41d2-a4ee-4579cd04da65/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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2023-11-29 02:25:52,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:25:52,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:25:52,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:25:52,428 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:25:52,428 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:25:52,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 02:25:55,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:25:55,442 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:25:55,442 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 02:25:55,458 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data/70aaf90c4/1d7352bc1f5340a4a46fa968e210d33b/FLAG2f7c4aad2 [2023-11-29 02:25:55,470 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data/70aaf90c4/1d7352bc1f5340a4a46fa968e210d33b [2023-11-29 02:25:55,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:25:55,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:25:55,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:25:55,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:25:55,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:25:55,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:55,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0b3e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55, skipping insertion in model container [2023-11-29 02:25:55,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:55,539 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:25:55,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:25:55,877 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:25:55,936 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:25:55,980 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:25:55,981 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:25:55,988 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:25:55,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55 WrapperNode [2023-11-29 02:25:55,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:25:55,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:25:55,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:25:55,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:25:55,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,041 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-29 02:25:56,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:25:56,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:25:56,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:25:56,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:25:56,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,074 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 02:25:56,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:25:56,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:25:56,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:25:56,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:25:56,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (1/1) ... [2023-11-29 02:25:56,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:25:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:25:56,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:25:56,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:25:56,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:25:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:25:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:25:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:25:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:25:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:25:56,155 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:25:56,155 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:25:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:25:56,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:25:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:25:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:25:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:25:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:25:56,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:25:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:25:56,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:25:56,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:25:56,158 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:25:56,286 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:25:56,287 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:25:56,595 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:25:56,778 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:25:56,779 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:25:56,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:25:56 BoogieIcfgContainer [2023-11-29 02:25:56,779 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:25:56,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:25:56,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:25:56,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:25:56,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:25:55" (1/3) ... [2023-11-29 02:25:56,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c510853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:25:56, skipping insertion in model container [2023-11-29 02:25:56,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:25:55" (2/3) ... [2023-11-29 02:25:56,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c510853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:25:56, skipping insertion in model container [2023-11-29 02:25:56,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:25:56" (3/3) ... [2023-11-29 02:25:56,788 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 02:25:56,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:25:56,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 02:25:56,808 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:25:56,885 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:25:56,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 02:25:56,953 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 02:25:56,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:25:56,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 02:25:56,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 02:25:56,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 02:25:56,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:25:56,979 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;@23d477ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:25:56,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:25:56,982 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:25:56,983 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:25:56,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:25:56,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:25:56,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:25:56,984 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 02:25:56,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:25:56,989 INFO L85 PathProgramCache]: Analyzing trace with hash 14227, now seen corresponding path program 1 times [2023-11-29 02:25:56,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:25:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253473245] [2023-11-29 02:25:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:25:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:25:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:25:57,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:25:57,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:25:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253473245] [2023-11-29 02:25:57,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253473245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:25:57,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:25:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:25:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651708337] [2023-11-29 02:25:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:25:57,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:25:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:25:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:25:57,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:25:57,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:25:57,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:25:57,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:25:57,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:25:57,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:25:58,707 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-29 02:25:58,708 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 02:25:58,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53851 event pairs, 3179 based on Foata normal form. 360/6962 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-29 02:25:58,784 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 02:25:58,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 02:25:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:25:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:25:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:25:58,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 02:25:58,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:25:58,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:25:58,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:25:58,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:25:58,803 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 02:25:58,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:25:58,807 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:25:58,809 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:25:58,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 02:25:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:25:58,819 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 02:25:58,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:25:58,824 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 02:25:58,825 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 02:25:58,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:25:58,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:25:58,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:25:58,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:25:58,826 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 02:25:58,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:25:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 14228, now seen corresponding path program 1 times [2023-11-29 02:25:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:25:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088100311] [2023-11-29 02:25:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:25:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:25:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:25:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:25:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:25:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088100311] [2023-11-29 02:25:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088100311] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:25:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:25:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:25:58,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599663215] [2023-11-29 02:25:58,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:25:58,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:25:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:25:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:25:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:25:58,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:25:58,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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 02:25:58,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:25:58,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:25:58,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:25:59,998 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-29 02:25:59,999 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:26:00,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53803 event pairs, 3179 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-29 02:26:00,041 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 02:26:00,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-29 02:26:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:26:00,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 02:26:00,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:26:00,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:26:00,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:00,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:26:00,046 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 02:26:00,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:00,048 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:00,048 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:26:00,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-29 02:26:00,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:00,057 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 02:26:00,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:26:00,058 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 02:26:00,058 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 02:26:00,059 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 02:26:00,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:00,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:26:00,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:26:00,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:26:00,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash 424276393, now seen corresponding path program 1 times [2023-11-29 02:26:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252748448] [2023-11-29 02:26:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252748448] [2023-11-29 02:26:00,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252748448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:00,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:00,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:26:00,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402489094] [2023-11-29 02:26:00,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:00,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:00,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 02:26:00,231 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.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 02:26:00,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:00,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 02:26:00,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:01,029 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-29 02:26:01,029 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 02:26:01,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39268 event pairs, 593 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-29 02:26:01,062 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-29 02:26:01,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-29 02:26:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 02:26:01,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-29 02:26:01,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 02:26:01,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 02:26:01,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:01,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 02:26:01,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,068 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-29 02:26:01,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-29 02:26:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:01,072 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-29 02:26:01,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-29 02:26:01,073 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 02:26:01,073 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-29 02:26:01,074 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 02:26:01,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:01,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:26:01,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:26:01,074 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:26:01,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 424275281, now seen corresponding path program 1 times [2023-11-29 02:26:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395027548] [2023-11-29 02:26:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395027548] [2023-11-29 02:26:01,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395027548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:01,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:26:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140365418] [2023-11-29 02:26:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:01,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:01,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:01,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:26:01,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:01,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:26:01,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:01,776 INFO L124 PetriNetUnfolderBase]: 2906/5175 cut-off events. [2023-11-29 02:26:01,777 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-29 02:26:01,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9587 conditions, 5175 events. 2906/5175 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37785 event pairs, 1880 based on Foata normal form. 0/4927 useless extension candidates. Maximal degree in co-relation 9576. Up to 3466 conditions per place. [2023-11-29 02:26:01,804 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 02:26:01,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 02:26:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:01,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:26:01,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:26:01,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:26:01,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:26:01,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:01,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:26:01,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,810 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,810 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:26:01,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 02:26:01,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:01,813 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 02:26:01,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 02:26:01,814 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 02:26:01,814 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 02:26:01,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:01,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:01,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:26:01,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:26:01,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:26:01,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash 424275282, now seen corresponding path program 1 times [2023-11-29 02:26:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964720910] [2023-11-29 02:26:01,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:01,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964720910] [2023-11-29 02:26:01,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964720910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:01,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:01,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:26:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351963272] [2023-11-29 02:26:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:01,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:01,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:01,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:01,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:26:01,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 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 02:26:01,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:01,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:26:01,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:02,543 INFO L124 PetriNetUnfolderBase]: 2903/5168 cut-off events. [2023-11-29 02:26:02,543 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:26:02,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9441 conditions, 5168 events. 2903/5168 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37758 event pairs, 1880 based on Foata normal form. 4/4924 useless extension candidates. Maximal degree in co-relation 9431. Up to 3459 conditions per place. [2023-11-29 02:26:02,576 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 02:26:02,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-29 02:26:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:26:02,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 02:26:02,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:26:02,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:26:02,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:02,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:26:02,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:02,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:02,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:02,580 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:26:02,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-29 02:26:02,583 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 02:26:02,584 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 02:26:02,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:26:02,585 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 02:26:02,585 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 02:26:02,586 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 02:26:02,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:02,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:26:02,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:26:02,586 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 02:26:02,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -503420956, now seen corresponding path program 1 times [2023-11-29 02:26:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001469679] [2023-11-29 02:26:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:02,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001469679] [2023-11-29 02:26:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001469679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:02,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:02,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:26:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656807135] [2023-11-29 02:26:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:02,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:02,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:02,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:26:02,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:02,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:02,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:26:02,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:03,178 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 02:26:03,179 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:26:03,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36957 event pairs, 1892 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-29 02:26:03,203 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 02:26:03,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-29 02:26:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:26:03,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:26:03,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:26:03,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:26:03,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:03,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:26:03,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,212 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:26:03,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-29 02:26:03,214 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 02:26:03,215 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 02:26:03,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:26:03,216 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 02:26:03,216 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 02:26:03,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:03,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:26:03,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:26:03,217 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 02:26:03,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:03,217 INFO L85 PathProgramCache]: Analyzing trace with hash -503420955, now seen corresponding path program 1 times [2023-11-29 02:26:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105263638] [2023-11-29 02:26:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:03,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:03,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105263638] [2023-11-29 02:26:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105263638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:26:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52075015] [2023-11-29 02:26:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:03,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:03,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:26:03,292 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.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 02:26:03,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:03,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:26:03,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:03,917 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-29 02:26:03,917 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:26:03,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36910 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-29 02:26:03,944 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 02:26:03,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-29 02:26:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:26:03,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 02:26:03,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:26:03,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:26:03,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:03,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:26:03,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:03,948 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:26:03,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-29 02:26:03,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:03,952 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 02:26:03,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:26:03,953 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 02:26:03,953 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 02:26:03,953 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 02:26:03,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:03,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:26:03,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:26:03,954 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 02:26:03,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash 612531236, now seen corresponding path program 1 times [2023-11-29 02:26:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667084500] [2023-11-29 02:26:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:04,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:04,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667084500] [2023-11-29 02:26:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667084500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:04,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:26:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44398612] [2023-11-29 02:26:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:04,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:04,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:04,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:04,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:04,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:26:04,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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 02:26:04,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:04,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:26:04,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:04,565 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-29 02:26:04,566 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:26:04,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36550 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-29 02:26:04,584 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 02:26:04,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-29 02:26:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:26:04,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:26:04,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:26:04,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:26:04,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:04,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:26:04,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:04,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:04,587 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:04,587 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:26:04,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-29 02:26:04,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:04,590 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 02:26:04,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:26:04,591 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 02:26:04,591 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 02:26:04,591 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 02:26:04,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:04,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:26:04,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:26:04,591 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 02:26:04,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 612531237, now seen corresponding path program 1 times [2023-11-29 02:26:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267436497] [2023-11-29 02:26:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267436497] [2023-11-29 02:26:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267436497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:26:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748314722] [2023-11-29 02:26:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:26:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:26:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:26:04,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:26:04,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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 02:26:04,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:04,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:26:04,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:05,189 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-29 02:26:05,189 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:26:05,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36419 event pairs, 920 based on Foata normal form. 36/4990 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-29 02:26:05,209 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 02:26:05,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 02:26:05,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:26:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:26:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:26:05,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 02:26:05,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:26:05,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:26:05,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:05,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:26:05,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:05,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:05,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:05,212 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:26:05,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 02:26:05,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:05,214 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 02:26:05,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 02:26:05,215 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 02:26:05,215 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 02:26:05,215 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 02:26:05,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:05,215 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 02:26:05,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:26:05,215 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 02:26:05,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:05,216 INFO L85 PathProgramCache]: Analyzing trace with hash -136945484, now seen corresponding path program 1 times [2023-11-29 02:26:05,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:05,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585699803] [2023-11-29 02:26:05,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:05,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:05,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:05,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585699803] [2023-11-29 02:26:05,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585699803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:05,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:05,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:26:05,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770513791] [2023-11-29 02:26:05,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:05,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:26:05,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:26:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:26:06,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 66 [2023-11-29 02:26:06,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:06,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:06,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 66 [2023-11-29 02:26:06,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:06,685 INFO L124 PetriNetUnfolderBase]: 2923/4925 cut-off events. [2023-11-29 02:26:06,685 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-29 02:26:06,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9267 conditions, 4925 events. 2923/4925 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 33871 event pairs, 1156 based on Foata normal form. 144/4954 useless extension candidates. Maximal degree in co-relation 9256. Up to 3315 conditions per place. [2023-11-29 02:26:06,703 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 37 selfloop transitions, 4 changer transitions 11/73 dead transitions. [2023-11-29 02:26:06,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 262 flow [2023-11-29 02:26:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:26:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:26:06,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2023-11-29 02:26:06,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5692640692640693 [2023-11-29 02:26:06,706 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 263 transitions. [2023-11-29 02:26:06,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 263 transitions. [2023-11-29 02:26:06,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:06,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 263 transitions. [2023-11-29 02:26:06,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 37.57142857142857) internal successors, (263), 7 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:06,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:06,709 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:06,709 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 7 states and 263 transitions. [2023-11-29 02:26:06,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 262 flow [2023-11-29 02:26:06,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:26:06,712 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 110 flow [2023-11-29 02:26:06,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-11-29 02:26:06,712 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 02:26:06,713 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 110 flow [2023-11-29 02:26:06,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:06,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:06,713 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 02:26:06,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:26:06,713 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 02:26:06,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -136943829, now seen corresponding path program 1 times [2023-11-29 02:26:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727199510] [2023-11-29 02:26:06,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:06,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727199510] [2023-11-29 02:26:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727199510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:26:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311949187] [2023-11-29 02:26:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:06,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:26:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:26:06,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:26:06,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 02:26:06,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 110 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 02:26:06,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:06,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 02:26:06,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:11,377 INFO L124 PetriNetUnfolderBase]: 36977/52962 cut-off events. [2023-11-29 02:26:11,378 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 02:26:11,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103094 conditions, 52962 events. 36977/52962 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 2310. Compared 383631 event pairs, 8615 based on Foata normal form. 0/51695 useless extension candidates. Maximal degree in co-relation 103083. Up to 17928 conditions per place. [2023-11-29 02:26:11,541 INFO L140 encePairwiseOnDemand]: 54/66 looper letters, 49 selfloop transitions, 8 changer transitions 103/176 dead transitions. [2023-11-29 02:26:11,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 176 transitions, 700 flow [2023-11-29 02:26:11,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:26:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:26:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 423 transitions. [2023-11-29 02:26:11,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:26:11,543 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 423 transitions. [2023-11-29 02:26:11,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 423 transitions. [2023-11-29 02:26:11,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:11,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 423 transitions. [2023-11-29 02:26:11,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.0) internal successors, (423), 9 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:11,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:11,546 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:11,546 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 110 flow. Second operand 9 states and 423 transitions. [2023-11-29 02:26:11,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 176 transitions, 700 flow [2023-11-29 02:26:11,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 176 transitions, 688 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:26:11,549 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 213 flow [2023-11-29 02:26:11,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=213, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-29 02:26:11,550 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 02:26:11,550 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 213 flow [2023-11-29 02:26:11,550 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 02:26:11,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:11,550 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 02:26:11,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:26:11,551 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 02:26:11,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 498700554, now seen corresponding path program 1 times [2023-11-29 02:26:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:11,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113065156] [2023-11-29 02:26:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113065156] [2023-11-29 02:26:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113065156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:26:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752165642] [2023-11-29 02:26:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:11,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:26:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:26:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:26:11,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 02:26:11,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:11,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:11,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 02:26:11,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:15,271 INFO L124 PetriNetUnfolderBase]: 19267/30743 cut-off events. [2023-11-29 02:26:15,271 INFO L125 PetriNetUnfolderBase]: For 26632/28183 co-relation queries the response was YES. [2023-11-29 02:26:15,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80080 conditions, 30743 events. 19267/30743 cut-off events. For 26632/28183 co-relation queries the response was YES. Maximal size of possible extension queue 1612. Compared 253375 event pairs, 5189 based on Foata normal form. 1219/30704 useless extension candidates. Maximal degree in co-relation 80061. Up to 15977 conditions per place. [2023-11-29 02:26:15,440 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 34 selfloop transitions, 3 changer transitions 43/106 dead transitions. [2023-11-29 02:26:15,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 537 flow [2023-11-29 02:26:15,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:26:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:26:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 314 transitions. [2023-11-29 02:26:15,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6796536796536796 [2023-11-29 02:26:15,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 314 transitions. [2023-11-29 02:26:15,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 314 transitions. [2023-11-29 02:26:15,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:15,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 314 transitions. [2023-11-29 02:26:15,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:15,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:15,445 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:15,445 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 213 flow. Second operand 7 states and 314 transitions. [2023-11-29 02:26:15,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 537 flow [2023-11-29 02:26:15,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 491 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-29 02:26:15,559 INFO L231 Difference]: Finished difference. Result has 73 places, 53 transitions, 202 flow [2023-11-29 02:26:15,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2023-11-29 02:26:15,560 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 02:26:15,560 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 202 flow [2023-11-29 02:26:15,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:15,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:15,561 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 02:26:15,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:26:15,561 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 02:26:15,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash 330041774, now seen corresponding path program 1 times [2023-11-29 02:26:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837001642] [2023-11-29 02:26:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837001642] [2023-11-29 02:26:15,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837001642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:15,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:15,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:26:15,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482399265] [2023-11-29 02:26:15,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:15,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:26:15,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:26:15,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:26:15,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 02:26:15,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 53 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:15,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:15,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 02:26:15,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:19,197 INFO L124 PetriNetUnfolderBase]: 18650/29477 cut-off events. [2023-11-29 02:26:19,197 INFO L125 PetriNetUnfolderBase]: For 35551/36943 co-relation queries the response was YES. [2023-11-29 02:26:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77276 conditions, 29477 events. 18650/29477 cut-off events. For 35551/36943 co-relation queries the response was YES. Maximal size of possible extension queue 1449. Compared 237161 event pairs, 5666 based on Foata normal form. 1044/29928 useless extension candidates. Maximal degree in co-relation 77254. Up to 19586 conditions per place. [2023-11-29 02:26:19,341 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 41 selfloop transitions, 5 changer transitions 49/119 dead transitions. [2023-11-29 02:26:19,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 647 flow [2023-11-29 02:26:19,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:26:19,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:26:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 317 transitions. [2023-11-29 02:26:19,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861471861471862 [2023-11-29 02:26:19,343 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 317 transitions. [2023-11-29 02:26:19,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 317 transitions. [2023-11-29 02:26:19,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:19,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 317 transitions. [2023-11-29 02:26:19,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.285714285714285) internal successors, (317), 7 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:19,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:19,346 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:19,346 INFO L175 Difference]: Start difference. First operand has 73 places, 53 transitions, 202 flow. Second operand 7 states and 317 transitions. [2023-11-29 02:26:19,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 647 flow [2023-11-29 02:26:20,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 119 transitions, 625 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 02:26:20,056 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 253 flow [2023-11-29 02:26:20,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-11-29 02:26:20,056 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 02:26:20,056 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 253 flow [2023-11-29 02:26:20,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:20,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:20,057 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 02:26:20,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:26:20,057 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 02:26:20,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash -938732217, now seen corresponding path program 1 times [2023-11-29 02:26:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:20,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208193995] [2023-11-29 02:26:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:20,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:20,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208193995] [2023-11-29 02:26:20,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208193995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:26:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108755048] [2023-11-29 02:26:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:20,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:26:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:20,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:26:20,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:26:20,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:26:20,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:20,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:20,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:26:20,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:25,445 INFO L124 PetriNetUnfolderBase]: 33247/50192 cut-off events. [2023-11-29 02:26:25,445 INFO L125 PetriNetUnfolderBase]: For 39441/46106 co-relation queries the response was YES. [2023-11-29 02:26:25,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121054 conditions, 50192 events. 33247/50192 cut-off events. For 39441/46106 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 382263 event pairs, 5247 based on Foata normal form. 2200/51238 useless extension candidates. Maximal degree in co-relation 121031. Up to 27211 conditions per place. [2023-11-29 02:26:25,720 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 57 selfloop transitions, 6 changer transitions 0/91 dead transitions. [2023-11-29 02:26:25,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 470 flow [2023-11-29 02:26:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:26:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:26:25,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2023-11-29 02:26:25,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-29 02:26:25,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 190 transitions. [2023-11-29 02:26:25,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 190 transitions. [2023-11-29 02:26:25,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:25,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 190 transitions. [2023-11-29 02:26:25,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.5) internal successors, (190), 4 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 02:26:25,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:25,723 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:25,723 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 253 flow. Second operand 4 states and 190 transitions. [2023-11-29 02:26:25,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 470 flow [2023-11-29 02:26:25,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 457 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 02:26:25,819 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 286 flow [2023-11-29 02:26:25,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-11-29 02:26:25,819 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2023-11-29 02:26:25,820 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 286 flow [2023-11-29 02:26:25,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:25,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:25,820 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] [2023-11-29 02:26:25,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:26:25,820 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 02:26:25,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash -39185230, now seen corresponding path program 1 times [2023-11-29 02:26:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:25,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204050012] [2023-11-29 02:26:25,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:25,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:26,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:26,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204050012] [2023-11-29 02:26:26,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204050012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:26,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:26,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:26:26,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406579427] [2023-11-29 02:26:26,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:26,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:26:26,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:26,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:26:26,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:26:26,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 02:26:26,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 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 02:26:26,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:26,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 02:26:26,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:34,457 INFO L124 PetriNetUnfolderBase]: 51074/76162 cut-off events. [2023-11-29 02:26:34,457 INFO L125 PetriNetUnfolderBase]: For 84824/88457 co-relation queries the response was YES. [2023-11-29 02:26:34,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210690 conditions, 76162 events. 51074/76162 cut-off events. For 84824/88457 co-relation queries the response was YES. Maximal size of possible extension queue 3295. Compared 617602 event pairs, 12780 based on Foata normal form. 1374/73286 useless extension candidates. Maximal degree in co-relation 210666. Up to 28146 conditions per place. [2023-11-29 02:26:34,945 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 143 selfloop transitions, 25 changer transitions 0/189 dead transitions. [2023-11-29 02:26:34,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 189 transitions, 1076 flow [2023-11-29 02:26:34,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:26:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 02:26:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 449 transitions. [2023-11-29 02:26:34,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6803030303030303 [2023-11-29 02:26:34,948 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 449 transitions. [2023-11-29 02:26:34,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 449 transitions. [2023-11-29 02:26:34,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:34,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 449 transitions. [2023-11-29 02:26:34,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.9) internal successors, (449), 10 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:34,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:34,951 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:34,951 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 286 flow. Second operand 10 states and 449 transitions. [2023-11-29 02:26:34,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 189 transitions, 1076 flow [2023-11-29 02:26:35,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 189 transitions, 1068 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-29 02:26:35,141 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 519 flow [2023-11-29 02:26:35,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=519, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2023-11-29 02:26:35,142 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2023-11-29 02:26:35,142 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 519 flow [2023-11-29 02:26:35,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 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 02:26:35,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:35,143 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] [2023-11-29 02:26:35,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:26:35,143 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 02:26:35,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:35,143 INFO L85 PathProgramCache]: Analyzing trace with hash 771965520, now seen corresponding path program 1 times [2023-11-29 02:26:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810353118] [2023-11-29 02:26:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:35,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810353118] [2023-11-29 02:26:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810353118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:26:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911808118] [2023-11-29 02:26:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:35,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:26:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:26:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:26:35,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:26:35,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:35,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:35,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:26:35,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:43,089 INFO L124 PetriNetUnfolderBase]: 45408/67572 cut-off events. [2023-11-29 02:26:43,089 INFO L125 PetriNetUnfolderBase]: For 92958/101520 co-relation queries the response was YES. [2023-11-29 02:26:43,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187845 conditions, 67572 events. 45408/67572 cut-off events. For 92958/101520 co-relation queries the response was YES. Maximal size of possible extension queue 2635. Compared 517252 event pairs, 5830 based on Foata normal form. 3681/69403 useless extension candidates. Maximal degree in co-relation 187811. Up to 26513 conditions per place. [2023-11-29 02:26:43,449 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 78 selfloop transitions, 10 changer transitions 8/132 dead transitions. [2023-11-29 02:26:43,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 132 transitions, 901 flow [2023-11-29 02:26:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:26:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:26:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 02:26:43,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:26:43,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 02:26:43,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 02:26:43,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:43,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 02:26:43,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:43,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:43,452 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:43,453 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 519 flow. Second operand 5 states and 242 transitions. [2023-11-29 02:26:43,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 132 transitions, 901 flow [2023-11-29 02:26:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 132 transitions, 869 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-11-29 02:26:44,777 INFO L231 Difference]: Finished difference. Result has 95 places, 76 transitions, 488 flow [2023-11-29 02:26:44,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=488, PETRI_PLACES=95, PETRI_TRANSITIONS=76} [2023-11-29 02:26:44,777 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 22 predicate places. [2023-11-29 02:26:44,777 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 76 transitions, 488 flow [2023-11-29 02:26:44,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:44,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:44,778 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] [2023-11-29 02:26:44,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:26:44,778 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 02:26:44,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash 304042552, now seen corresponding path program 1 times [2023-11-29 02:26:44,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:44,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650770373] [2023-11-29 02:26:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:44,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:45,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650770373] [2023-11-29 02:26:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650770373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:45,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:45,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:26:45,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841561701] [2023-11-29 02:26:45,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:45,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:26:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:45,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:26:45,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:26:45,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:26:45,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 76 transitions, 488 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:45,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:45,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:26:45,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:51,225 INFO L124 PetriNetUnfolderBase]: 33576/49572 cut-off events. [2023-11-29 02:26:51,226 INFO L125 PetriNetUnfolderBase]: For 76930/83090 co-relation queries the response was YES. [2023-11-29 02:26:51,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149642 conditions, 49572 events. 33576/49572 cut-off events. For 76930/83090 co-relation queries the response was YES. Maximal size of possible extension queue 2294. Compared 365700 event pairs, 3668 based on Foata normal form. 2275/50090 useless extension candidates. Maximal degree in co-relation 149604. Up to 17098 conditions per place. [2023-11-29 02:26:51,491 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 92 selfloop transitions, 14 changer transitions 2/143 dead transitions. [2023-11-29 02:26:51,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 143 transitions, 964 flow [2023-11-29 02:26:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:26:51,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:26:51,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-29 02:26:51,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 02:26:51,493 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-29 02:26:51,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-29 02:26:51,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:51,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-29 02:26:51,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:51,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:51,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:51,495 INFO L175 Difference]: Start difference. First operand has 95 places, 76 transitions, 488 flow. Second operand 6 states and 292 transitions. [2023-11-29 02:26:51,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 143 transitions, 964 flow [2023-11-29 02:26:51,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 143 transitions, 936 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-29 02:26:51,657 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 538 flow [2023-11-29 02:26:51,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2023-11-29 02:26:51,657 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 23 predicate places. [2023-11-29 02:26:51,657 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 538 flow [2023-11-29 02:26:51,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:51,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:26:51,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:26:51,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:26:51,658 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 02:26:51,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:26:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1483558371, now seen corresponding path program 1 times [2023-11-29 02:26:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:26:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677224883] [2023-11-29 02:26:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:26:51,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:26:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:26:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:26:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677224883] [2023-11-29 02:26:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677224883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:26:52,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:26:52,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:26:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711669910] [2023-11-29 02:26:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:26:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:26:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:26:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:26:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:26:52,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:26:52,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 538 flow. Second operand has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:52,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:26:52,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:26:52,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:26:59,043 INFO L124 PetriNetUnfolderBase]: 31096/54264 cut-off events. [2023-11-29 02:26:59,044 INFO L125 PetriNetUnfolderBase]: For 94552/110296 co-relation queries the response was YES. [2023-11-29 02:26:59,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160120 conditions, 54264 events. 31096/54264 cut-off events. For 94552/110296 co-relation queries the response was YES. Maximal size of possible extension queue 3572. Compared 538165 event pairs, 10934 based on Foata normal form. 1486/50780 useless extension candidates. Maximal degree in co-relation 160081. Up to 22674 conditions per place. [2023-11-29 02:26:59,404 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 68 selfloop transitions, 19 changer transitions 24/162 dead transitions. [2023-11-29 02:26:59,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 162 transitions, 1108 flow [2023-11-29 02:26:59,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:26:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 02:26:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 380 transitions. [2023-11-29 02:26:59,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2023-11-29 02:26:59,406 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 380 transitions. [2023-11-29 02:26:59,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 380 transitions. [2023-11-29 02:26:59,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:26:59,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 380 transitions. [2023-11-29 02:26:59,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 47.5) internal successors, (380), 8 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:59,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:59,408 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:26:59,408 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 538 flow. Second operand 8 states and 380 transitions. [2023-11-29 02:26:59,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 162 transitions, 1108 flow [2023-11-29 02:27:00,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 162 transitions, 1059 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-11-29 02:27:00,930 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 637 flow [2023-11-29 02:27:00,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=637, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2023-11-29 02:27:00,931 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 29 predicate places. [2023-11-29 02:27:00,931 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 637 flow [2023-11-29 02:27:00,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.714285714285715) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:00,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:27:00,931 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 02:27:00,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:27:00,931 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 02:27:00,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:27:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1696122299, now seen corresponding path program 2 times [2023-11-29 02:27:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:27:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886238260] [2023-11-29 02:27:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:27:00,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:27:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:27:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:27:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:27:01,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886238260] [2023-11-29 02:27:01,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886238260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:27:01,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:27:01,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:27:01,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975088444] [2023-11-29 02:27:01,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:27:01,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:27:01,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:27:01,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:27:01,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:27:01,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 02:27:01,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 637 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:01,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:27:01,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 02:27:01,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:27:12,595 INFO L124 PetriNetUnfolderBase]: 53715/89203 cut-off events. [2023-11-29 02:27:12,595 INFO L125 PetriNetUnfolderBase]: For 172026/195631 co-relation queries the response was YES. [2023-11-29 02:27:13,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284504 conditions, 89203 events. 53715/89203 cut-off events. For 172026/195631 co-relation queries the response was YES. Maximal size of possible extension queue 6063. Compared 892674 event pairs, 19573 based on Foata normal form. 2735/82557 useless extension candidates. Maximal degree in co-relation 284464. Up to 35899 conditions per place. [2023-11-29 02:27:13,267 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 84 selfloop transitions, 6 changer transitions 27/162 dead transitions. [2023-11-29 02:27:13,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 162 transitions, 1233 flow [2023-11-29 02:27:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:27:13,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:27:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2023-11-29 02:27:13,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2023-11-29 02:27:13,269 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 232 transitions. [2023-11-29 02:27:13,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 232 transitions. [2023-11-29 02:27:13,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:27:13,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 232 transitions. [2023-11-29 02:27:13,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.4) internal successors, (232), 5 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 02:27:13,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:13,271 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:13,271 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 637 flow. Second operand 5 states and 232 transitions. [2023-11-29 02:27:13,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 162 transitions, 1233 flow [2023-11-29 02:27:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 162 transitions, 1205 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-29 02:27:17,937 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 679 flow [2023-11-29 02:27:17,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2023-11-29 02:27:17,938 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 28 predicate places. [2023-11-29 02:27:17,938 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 679 flow [2023-11-29 02:27:17,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:17,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:27:17,938 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 02:27:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:27:17,938 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 02:27:17,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:27:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash -18123561, now seen corresponding path program 3 times [2023-11-29 02:27:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:27:17,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823439064] [2023-11-29 02:27:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:27:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:27:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:27:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:27:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:27:18,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823439064] [2023-11-29 02:27:18,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823439064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:27:18,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:27:18,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:27:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045566660] [2023-11-29 02:27:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:27:18,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:27:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:27:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:27:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:27:18,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 66 [2023-11-29 02:27:18,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 679 flow. Second operand has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:18,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:27:18,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 66 [2023-11-29 02:27:18,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:27:34,160 INFO L124 PetriNetUnfolderBase]: 78056/124883 cut-off events. [2023-11-29 02:27:34,160 INFO L125 PetriNetUnfolderBase]: For 293167/322521 co-relation queries the response was YES. [2023-11-29 02:27:34,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416138 conditions, 124883 events. 78056/124883 cut-off events. For 293167/322521 co-relation queries the response was YES. Maximal size of possible extension queue 8347. Compared 1221995 event pairs, 17431 based on Foata normal form. 3173/116426 useless extension candidates. Maximal degree in co-relation 416097. Up to 51378 conditions per place. [2023-11-29 02:27:34,966 INFO L140 encePairwiseOnDemand]: 50/66 looper letters, 151 selfloop transitions, 70 changer transitions 66/318 dead transitions. [2023-11-29 02:27:34,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 318 transitions, 2650 flow [2023-11-29 02:27:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:27:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:27:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 497 transitions. [2023-11-29 02:27:34,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6845730027548209 [2023-11-29 02:27:34,969 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 497 transitions. [2023-11-29 02:27:34,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 497 transitions. [2023-11-29 02:27:34,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:27:34,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 497 transitions. [2023-11-29 02:27:34,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 45.18181818181818) internal successors, (497), 11 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:34,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 66.0) internal successors, (792), 12 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:34,972 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 66.0) internal successors, (792), 12 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:34,972 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 679 flow. Second operand 11 states and 497 transitions. [2023-11-29 02:27:34,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 318 transitions, 2650 flow [2023-11-29 02:27:44,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 318 transitions, 2581 flow, removed 21 selfloop flow, removed 5 redundant places. [2023-11-29 02:27:44,434 INFO L231 Difference]: Finished difference. Result has 113 places, 151 transitions, 1345 flow [2023-11-29 02:27:44,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1345, PETRI_PLACES=113, PETRI_TRANSITIONS=151} [2023-11-29 02:27:44,435 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 40 predicate places. [2023-11-29 02:27:44,435 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 151 transitions, 1345 flow [2023-11-29 02:27:44,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:44,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:27:44,435 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 02:27:44,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:27:44,436 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 02:27:44,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:27:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash 675486045, now seen corresponding path program 4 times [2023-11-29 02:27:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:27:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796604652] [2023-11-29 02:27:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:27:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:27:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:27:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:27:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:27:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796604652] [2023-11-29 02:27:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796604652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:27:44,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:27:44,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:27:44,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425015778] [2023-11-29 02:27:44,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:27:44,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:27:44,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:27:44,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:27:44,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:27:44,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:27:44,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 151 transitions, 1345 flow. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:27:44,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:27:44,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:27:44,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:06,937 INFO L124 PetriNetUnfolderBase]: 108900/158831 cut-off events. [2023-11-29 02:28:06,937 INFO L125 PetriNetUnfolderBase]: For 535358/559021 co-relation queries the response was YES. [2023-11-29 02:28:07,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608674 conditions, 158831 events. 108900/158831 cut-off events. For 535358/559021 co-relation queries the response was YES. Maximal size of possible extension queue 6782. Compared 1302501 event pairs, 8518 based on Foata normal form. 5983/161781 useless extension candidates. Maximal degree in co-relation 608627. Up to 59370 conditions per place. [2023-11-29 02:28:07,869 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 139 selfloop transitions, 18 changer transitions 60/272 dead transitions. [2023-11-29 02:28:07,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 272 transitions, 2596 flow [2023-11-29 02:28:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:28:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 320 transitions. [2023-11-29 02:28:07,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6926406926406926 [2023-11-29 02:28:07,872 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 320 transitions. [2023-11-29 02:28:07,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 320 transitions. [2023-11-29 02:28:07,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:07,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 320 transitions. [2023-11-29 02:28:07,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.714285714285715) internal successors, (320), 7 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:07,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:07,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:07,875 INFO L175 Difference]: Start difference. First operand has 113 places, 151 transitions, 1345 flow. Second operand 7 states and 320 transitions. [2023-11-29 02:28:07,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 272 transitions, 2596 flow [2023-11-29 02:28:30,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 272 transitions, 2468 flow, removed 31 selfloop flow, removed 7 redundant places. [2023-11-29 02:28:30,891 INFO L231 Difference]: Finished difference. Result has 112 places, 128 transitions, 1063 flow [2023-11-29 02:28:30,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1063, PETRI_PLACES=112, PETRI_TRANSITIONS=128} [2023-11-29 02:28:30,892 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 39 predicate places. [2023-11-29 02:28:30,892 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 128 transitions, 1063 flow [2023-11-29 02:28:30,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:30,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:30,893 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] [2023-11-29 02:28:30,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:28:30,893 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 02:28:30,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1071919587, now seen corresponding path program 1 times [2023-11-29 02:28:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781016403] [2023-11-29 02:28:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:30,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:28:31,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:31,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781016403] [2023-11-29 02:28:31,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781016403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:31,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:31,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120137013] [2023-11-29 02:28:31,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:31,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:31,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:31,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 02:28:31,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 128 transitions, 1063 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:31,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:31,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 02:28:31,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:32,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][152], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 192#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 194#(= ~y~0 1), 317#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 129#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 46#L840true, 245#true, 327#true, 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 16#L872true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 17#$Ultimate##0true, Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 35#L811true, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:32,168 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2023-11-29 02:28:32,168 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-29 02:28:32,168 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-29 02:28:32,168 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2023-11-29 02:28:33,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][65], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 317#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 58#L784true, 245#true, 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 16#L872true, 62#L824true, Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), 35#L811true, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:33,015 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,015 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,015 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,015 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][150], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 192#true, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 194#(= ~y~0 1), 317#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 129#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 46#L840true, 245#true, 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 16#L872true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 27#L781true, Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 35#L811true, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:33,019 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,019 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,019 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,019 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][152], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 192#true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 194#(= ~y~0 1), Black: 129#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 46#L840true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 327#true, Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 16#L872true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 17#$Ultimate##0true, Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:33,075 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,075 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,075 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,075 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is not cut-off event [2023-11-29 02:28:33,555 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 317#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 245#true, 58#L784true, 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 16#L872true, 62#L824true, 53#L771true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), 35#L811true, 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:33,556 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,556 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,556 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,556 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][152], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 192#true, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 194#(= ~y~0 1), Black: 129#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 46#L840true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 327#true, Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 17#$Ultimate##0true, Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:33,684 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-29 02:28:33,684 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-29 02:28:34,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][65], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 58#L784true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 16#L872true, 62#L824true, Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:34,544 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,544 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,544 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,544 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][150], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 192#true, 66#P2EXITtrue, P2Thread1of1ForFork0InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 194#(= ~y~0 1), Black: 129#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 46#L840true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 16#L872true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 27#L781true, Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:34,552 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,552 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,552 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-29 02:28:34,552 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is not cut-off event [2023-11-29 02:28:35,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 245#true, 58#L784true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 16#L872true, 62#L824true, 43#P0EXITtrue, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), 35#L811true, 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:35,243 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,243 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,244 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,244 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), 194#(= ~y~0 1), Black: 127#true, Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 58#L784true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 16#L872true, 62#L824true, 53#L771true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:35,302 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,302 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,302 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,302 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][65], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 245#true, 58#L784true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, 62#L824true, Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:35,401 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,401 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,401 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,401 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([463] L824-->L840: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse5 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse6 (not .cse5)) (.cse12 (= (mod v_~a$w_buff0_used~0_138 256) 0)) (.cse2 (and .cse5 .cse8)) (.cse3 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse5))) (let ((.cse9 (or .cse12 .cse2 .cse3)) (.cse10 (and .cse6 (not .cse12)))) (let ((.cse1 (= (mod v_~a$w_buff0_used~0_137 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse11 (ite .cse9 v_~a~0_74 (ite .cse10 v_~a$w_buff0~0_55 v_~a$w_buff1~0_48)))) (and (= v_~a$flush_delayed~0_23 0) (= v_~a$w_buff0~0_54 v_~a$w_buff0~0_55) (= v_~a$w_buff1~0_48 v_~a$w_buff1~0_47) (= (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse1 .cse2 .cse3) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse0 v_~a$r_buff0_thd4~0_62 (ite (or .cse1 (and .cse4 .cse5) .cse2) v_~a$r_buff0_thd4~0_62 (ite (and .cse6 (not .cse1)) 0 v_~a$r_buff0_thd4~0_62))) v_~a$r_buff0_thd4~0_61) (= v_~a$r_buff1_thd4~0_59 (ite .cse0 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse7 .cse4))) v_~a$r_buff1_thd4~0_60 0))) (= v_~a$w_buff0_used~0_137 (ite .cse0 v_~a$w_buff0_used~0_138 (ite .cse9 v_~a$w_buff0_used~0_138 (ite .cse10 0 v_~a$w_buff0_used~0_138)))) (= v_~a~0_74 v_~a$mem_tmp~0_18) (= .cse11 v_~__unbuffered_p3_EBX~0_10) (= v_~a~0_72 (ite .cse0 v_~a$mem_tmp~0_18 .cse11))))))) InVars {~a~0=v_~a~0_74, ~a$w_buff1~0=v_~a$w_buff1~0_48, ~a$w_buff0~0=v_~a$w_buff0~0_55, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_138, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_137, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_72, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~a$w_buff1~0=v_~a$w_buff1~0_47, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_54, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][150], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 192#true, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 194#(= ~y~0 1), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 129#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 46#L840true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 29#L764true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 27#L781true, Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:35,414 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,414 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,414 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:35,414 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is not cut-off event [2023-11-29 02:28:36,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 58#L784true, 245#true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 62#L824true, 43#P0EXITtrue, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 35#L811true, 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:36,403 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,403 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,403 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,403 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 321#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 127#true, 194#(= ~y~0 1), Black: 267#(= ~z~0 1), 245#true, 58#L784true, 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 16#L872true, 62#L824true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 55#L774true]) [2023-11-29 02:28:36,452 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,452 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,452 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,452 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [319#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 66#P2EXITtrue, P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 127#true, Black: 267#(= ~z~0 1), 245#true, 58#L784true, 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), Black: 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), 62#L824true, 53#L771true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 168#(= ~y~0 0), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:36,513 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,513 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,513 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:36,513 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-11-29 02:28:37,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 321#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 127#true, 194#(= ~y~0 1), Black: 267#(= ~z~0 1), 245#true, 58#L784true, 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 16#L872true, 62#L824true, 43#P0EXITtrue, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:37,733 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,733 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,733 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,733 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, 321#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 127#true, 194#(= ~y~0 1), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 58#L784true, 245#true, 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 62#L824true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 55#L774true]) [2023-11-29 02:28:37,770 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,770 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,770 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,771 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, P3Thread1of1ForFork2InUse, 321#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), 194#(= ~y~0 1), Black: 127#true, Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 267#(= ~z~0 1), 58#L784true, 245#true, 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 62#L824true, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 11#L874true, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 55#L774true]) [2023-11-29 02:28:37,773 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,773 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,773 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:37,773 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-11-29 02:28:38,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 321#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork2InUse, P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 127#true, Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 194#(= ~y~0 1), Black: 267#(= ~z~0 1), 58#L784true, 245#true, 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 62#L824true, 43#P0EXITtrue, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 11#L874true, Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:38,960 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,961 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,961 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,961 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L781-->L784: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0][88], [Black: 248#(and (= ~a~0 1) (<= 0 (div ~a$w_buff0_used~0 256)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))), Black: 323#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 3) (<= 0 ~main$tmp_guard0~0)), Black: 247#(and (<= (div ~a$w_buff0_used~0 256) 0) (= ~a$w_buff0~0 1) (<= 1 ~a$w_buff0_used~0) (= ~a$r_buff0_thd1~0 1)), Black: 315#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 249#(= ~__unbuffered_p3_EBX~0 1), P1Thread1of1ForFork1InUse, P2Thread1of1ForFork0InUse, 66#P2EXITtrue, P3Thread1of1ForFork2InUse, 321#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork3InUse, Black: 135#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 133#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0)), 124#(and (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|)) (not (= |ULTIMATE.start_main_~#t771~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t770~0#1.base| 0) |ULTIMATE.start_main_~#t769~0#1.base| 0) |ULTIMATE.start_main_~#t771~0#1.base| 0) |ULTIMATE.start_main_~#t772~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t771~0#1.base|)) (not (= |ULTIMATE.start_main_~#t772~0#1.base| |ULTIMATE.start_main_~#t770~0#1.base|)) (not (= |ULTIMATE.start_main_~#t770~0#1.base| |ULTIMATE.start_main_~#t769~0#1.base|))), Black: 195#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 127#true, 194#(= ~y~0 1), Black: 267#(= ~z~0 1), 245#true, 58#L784true, 222#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 226#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 62#L824true, 43#P0EXITtrue, Black: 292#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 282#(and (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 283#(and (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (not (= ~a$w_buff1~0 0))) (= ~a$r_buff1_thd4~0 0) (or (not (= ~a$w_buff0~0 0)) (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (= ~a$r_buff1_thd3~0 0) (= ~a~0 0) (or (not (= ~a$w_buff0_used~0 (* 256 (div ~a$w_buff0_used~0 256)))) (and (not (= (* 256 (div ~a$w_buff1_used~0 256)) ~a$w_buff1_used~0)) (not (= ~a$r_buff1_thd1~0 (* 256 (div ~a$r_buff1_thd1~0 256)))))) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), 329#(= ~x~0 1), Black: 286#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 290#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a~0 0) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 235#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 284#(and (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), Black: 168#(= ~y~0 0), 241#(and (<= ~__unbuffered_cnt~0 2) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), 294#(and (= ~a$r_buff1_thd4~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= ~a$r_buff1_thd3~0 0) (not (= ~a~0 0)) (= ~a$r_buff0_thd3~0 0) (= ~a$r_buff0_thd4~0 0)), 11#L874true, Black: 186#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 188#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0))]) [2023-11-29 02:28:38,963 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,963 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,963 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-29 02:28:38,963 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-11-29 02:28:43,123 INFO L124 PetriNetUnfolderBase]: 54978/94608 cut-off events. [2023-11-29 02:28:43,123 INFO L125 PetriNetUnfolderBase]: For 309905/337384 co-relation queries the response was YES. [2023-11-29 02:28:43,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344429 conditions, 94608 events. 54978/94608 cut-off events. For 309905/337384 co-relation queries the response was YES. Maximal size of possible extension queue 7322. Compared 999188 event pairs, 16288 based on Foata normal form. 1891/86313 useless extension candidates. Maximal degree in co-relation 344385. Up to 34674 conditions per place. [2023-11-29 02:28:43,848 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 57 selfloop transitions, 1 changer transitions 80/206 dead transitions. [2023-11-29 02:28:43,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 206 transitions, 1827 flow [2023-11-29 02:28:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:28:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:28:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2023-11-29 02:28:43,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6691919191919192 [2023-11-29 02:28:43,850 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 265 transitions. [2023-11-29 02:28:43,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 265 transitions. [2023-11-29 02:28:43,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:43,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 265 transitions. [2023-11-29 02:28:43,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:43,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:43,851 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:28:43,851 INFO L175 Difference]: Start difference. First operand has 112 places, 128 transitions, 1063 flow. Second operand 6 states and 265 transitions. [2023-11-29 02:28:43,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 206 transitions, 1827 flow [2023-11-29 02:29:05,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 206 transitions, 1690 flow, removed 47 selfloop flow, removed 8 redundant places. [2023-11-29 02:29:05,509 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 854 flow [2023-11-29 02:29:05,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=854, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2023-11-29 02:29:05,509 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 38 predicate places. [2023-11-29 02:29:05,509 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 854 flow [2023-11-29 02:29:05,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:05,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:05,510 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] [2023-11-29 02:29:05,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:29:05,510 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:29:05,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1210207397, now seen corresponding path program 2 times [2023-11-29 02:29:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350619745] [2023-11-29 02:29:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:06,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:06,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350619745] [2023-11-29 02:29:06,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350619745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:06,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:29:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700243610] [2023-11-29 02:29:06,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:06,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:06,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:06,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:29:06,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 854 flow. Second operand has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 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 02:29:06,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:06,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:29:06,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:10,967 INFO L124 PetriNetUnfolderBase]: 21223/38465 cut-off events. [2023-11-29 02:29:10,967 INFO L125 PetriNetUnfolderBase]: For 84315/92239 co-relation queries the response was YES. [2023-11-29 02:29:11,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124756 conditions, 38465 events. 21223/38465 cut-off events. For 84315/92239 co-relation queries the response was YES. Maximal size of possible extension queue 3177. Compared 387957 event pairs, 3453 based on Foata normal form. 860/35372 useless extension candidates. Maximal degree in co-relation 124713. Up to 16137 conditions per place. [2023-11-29 02:29:11,174 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 69 selfloop transitions, 14 changer transitions 17/170 dead transitions. [2023-11-29 02:29:11,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 170 transitions, 1295 flow [2023-11-29 02:29:11,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:29:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 396 transitions. [2023-11-29 02:29:11,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 02:29:11,176 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 396 transitions. [2023-11-29 02:29:11,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 396 transitions. [2023-11-29 02:29:11,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:11,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 396 transitions. [2023-11-29 02:29:11,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.0) internal successors, (396), 9 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:11,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:11,178 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:11,178 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 854 flow. Second operand 9 states and 396 transitions. [2023-11-29 02:29:11,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 170 transitions, 1295 flow [2023-11-29 02:29:14,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 170 transitions, 1260 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-29 02:29:14,871 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 918 flow [2023-11-29 02:29:14,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=918, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2023-11-29 02:29:14,872 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 42 predicate places. [2023-11-29 02:29:14,872 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 918 flow [2023-11-29 02:29:14,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 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 02:29:14,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:14,872 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] [2023-11-29 02:29:14,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:29:14,873 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:29:14,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2102377337, now seen corresponding path program 3 times [2023-11-29 02:29:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:14,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396991684] [2023-11-29 02:29:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:15,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:15,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396991684] [2023-11-29 02:29:15,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396991684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:15,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:15,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:29:15,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328665197] [2023-11-29 02:29:15,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:15,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:29:15,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:15,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:29:15,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:29:15,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:29:15,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 918 flow. Second operand has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:15,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:15,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:29:15,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:20,054 INFO L124 PetriNetUnfolderBase]: 20332/36839 cut-off events. [2023-11-29 02:29:20,054 INFO L125 PetriNetUnfolderBase]: For 94261/101163 co-relation queries the response was YES. [2023-11-29 02:29:20,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123394 conditions, 36839 events. 20332/36839 cut-off events. For 94261/101163 co-relation queries the response was YES. Maximal size of possible extension queue 2940. Compared 369464 event pairs, 5373 based on Foata normal form. 720/33484 useless extension candidates. Maximal degree in co-relation 123350. Up to 12830 conditions per place. [2023-11-29 02:29:20,265 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 57 selfloop transitions, 12 changer transitions 23/162 dead transitions. [2023-11-29 02:29:20,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 162 transitions, 1262 flow [2023-11-29 02:29:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:29:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 391 transitions. [2023-11-29 02:29:20,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6582491582491582 [2023-11-29 02:29:20,267 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 391 transitions. [2023-11-29 02:29:20,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 391 transitions. [2023-11-29 02:29:20,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:20,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 391 transitions. [2023-11-29 02:29:20,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 43.44444444444444) internal successors, (391), 9 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:20,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:20,269 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:20,269 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 918 flow. Second operand 9 states and 391 transitions. [2023-11-29 02:29:20,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 162 transitions, 1262 flow [2023-11-29 02:29:23,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 162 transitions, 1218 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-29 02:29:23,543 INFO L231 Difference]: Finished difference. Result has 120 places, 112 transitions, 898 flow [2023-11-29 02:29:23,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=898, PETRI_PLACES=120, PETRI_TRANSITIONS=112} [2023-11-29 02:29:23,544 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 47 predicate places. [2023-11-29 02:29:23,544 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 112 transitions, 898 flow [2023-11-29 02:29:23,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:23,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:23,544 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] [2023-11-29 02:29:23,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:29:23,544 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:29:23,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash -300186103, now seen corresponding path program 4 times [2023-11-29 02:29:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:23,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610897730] [2023-11-29 02:29:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:23,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:29:23,589 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:29:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:29:23,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:29:23,665 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:29:23,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 02:29:23,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 02:29:23,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 02:29:23,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 02:29:23,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:29:23,670 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:23,675 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:29:23,675 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:29:23,730 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:29:23,732 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:29:23,732 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:29:23,734 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:29:23,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:29:23,750 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:29:23,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:29:23 BasicIcfg [2023-11-29 02:29:23,763 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:29:23,763 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:29:23,763 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:29:23,764 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:29:23,764 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:25:56" (3/4) ... [2023-11-29 02:29:23,765 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:29:23,766 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:29:23,767 INFO L158 Benchmark]: Toolchain (without parser) took 208292.78ms. Allocated memory was 144.7MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 99.4MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-29 02:29:23,767 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:23,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.98ms. Allocated memory is still 144.7MB. Free memory was 99.4MB in the beginning and 112.5MB in the end (delta: -13.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2023-11-29 02:29:23,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.65ms. Allocated memory is still 144.7MB. Free memory was 112.5MB in the beginning and 109.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:29:23,767 INFO L158 Benchmark]: Boogie Preprocessor took 55.96ms. Allocated memory is still 144.7MB. Free memory was 109.6MB in the beginning and 105.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:29:23,768 INFO L158 Benchmark]: RCFGBuilder took 680.53ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 50.9MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2023-11-29 02:29:23,768 INFO L158 Benchmark]: TraceAbstraction took 206981.41ms. Allocated memory was 144.7MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 50.3MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-29 02:29:23,768 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 13.2GB. Free memory is still 9.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:23,770 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.17ms. Allocated memory is still 107.0MB. Free memory is still 55.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.98ms. Allocated memory is still 144.7MB. Free memory was 99.4MB in the beginning and 112.5MB in the end (delta: -13.1MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.65ms. Allocated memory is still 144.7MB. Free memory was 112.5MB in the beginning and 109.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.96ms. Allocated memory is still 144.7MB. Free memory was 109.6MB in the beginning and 105.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 680.53ms. Allocated memory is still 144.7MB. Free memory was 105.4MB in the beginning and 50.9MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 206981.41ms. Allocated memory was 144.7MB in the beginning and 13.2GB in the end (delta: 13.0GB). Free memory was 50.3MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 13.2GB. Free memory is still 9.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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={5:0}, t770={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={5:0}, t770={6:0}, t771={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, z=1] [L786] 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) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 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 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 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_p0_EAX=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=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 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) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=2] [L842] 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) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 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 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 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_p0_EAX=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=1, y=2, z=2] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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_p0_EAX=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=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=2] [L806] 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) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 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 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 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=1, __unbuffered_p0_EAX=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=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, y=2, z=2] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice2=1, x=1, y=2, z=2] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 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 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 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_p0_EAX=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, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice2=1, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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, t769={5:0}, t770={6:0}, t771={7:0}, t772={3:0}, weak$$choice2=1, x=1, y=2, z=2] [L886] 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_p0_EAX=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=1, y=2, z=2] [L17] 0 __assert_fail ("0", "mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, y=2, 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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 869]: 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: 871]: 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: 865]: 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, 99 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: 206.8s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 200.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1547 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1362 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 335 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4337 IncrementalHoareTripleChecker+Invalid, 4466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 98 mSDtfsCounter, 4337 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=20, InterpolantAutomatonStates: 137, 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, 5.4s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 4639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 02:29:23,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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_a37da928-d70f-41d2-a4ee-4579cd04da65/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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:29:26,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:29:26,406 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:29:26,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:29:26,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:29:26,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:29:26,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:29:26,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:29:26,444 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:29:26,445 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:29:26,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:29:26,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:29:26,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:29:26,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:29:26,448 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:29:26,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:29:26,449 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:29:26,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:29:26,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:29:26,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:29:26,451 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:29:26,452 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:29:26,453 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:29:26,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:29:26,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:29:26,454 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:29:26,454 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:29:26,455 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:29:26,455 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:29:26,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:29:26,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:29:26,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:29:26,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:29:26,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:29:26,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:29:26,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:29:26,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:29:26,458 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:29:26,458 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:29:26,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:29:26,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:29:26,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:29:26,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:29:26,460 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:29:26,460 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_a37da928-d70f-41d2-a4ee-4579cd04da65/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_a37da928-d70f-41d2-a4ee-4579cd04da65/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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2023-11-29 02:29:26,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:29:26,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:29:26,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:29:26,780 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:29:26,781 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:29:26,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 02:29:29,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:29:29,809 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:29:29,810 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/sv-benchmarks/c/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 02:29:29,826 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data/c6ec10065/e402bfbd0c924e95a738412599baeb7a/FLAG6adf8c3db [2023-11-29 02:29:29,841 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/data/c6ec10065/e402bfbd0c924e95a738412599baeb7a [2023-11-29 02:29:29,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:29:29,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:29:29,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:29:29,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:29:29,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:29:29,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:29:29" (1/1) ... [2023-11-29 02:29:29,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1863213e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:29, skipping insertion in model container [2023-11-29 02:29:29,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:29:29" (1/1) ... [2023-11-29 02:29:29,910 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:29:30,268 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:29:30,284 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:29:30,336 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:29:30,374 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:29:30,374 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:29:30,382 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:29:30,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30 WrapperNode [2023-11-29 02:29:30,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:29:30,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:29:30,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:29:30,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:29:30,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,439 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-29 02:29:30,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:29:30,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:29:30,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:29:30,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:29:30,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,483 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 02:29:30,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:29:30,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:29:30,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:29:30,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:29:30,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (1/1) ... [2023-11-29 02:29:30,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:29:30,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:29:30,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:29:30,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:29:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:29:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:29:30,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:29:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:29:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:29:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:29:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:29:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:29:30,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 02:29:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:29:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:29:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:29:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:29:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 02:29:30,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:29:30,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:29:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:29:30,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:29:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:29:30,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:29:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:29:30,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:29:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:29:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:29:30,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:29:30,586 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:29:30,750 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:29:30,751 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:29:31,113 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:29:31,347 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:29:31,348 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:29:31,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:31 BoogieIcfgContainer [2023-11-29 02:29:31,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:29:31,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:29:31,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:29:31,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:29:31,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:29:29" (1/3) ... [2023-11-29 02:29:31,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd24c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:29:31, skipping insertion in model container [2023-11-29 02:29:31,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:29:30" (2/3) ... [2023-11-29 02:29:31,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd24c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:29:31, skipping insertion in model container [2023-11-29 02:29:31,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:31" (3/3) ... [2023-11-29 02:29:31,356 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2023-11-29 02:29:31,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:29:31,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 02:29:31,388 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:29:31,467 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:29:31,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 02:29:31,524 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 02:29:31,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:29:31,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 02:29:31,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 02:29:31,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 02:29:31,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:29:31,547 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;@31204c22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:29:31,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:29:31,551 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:29:31,551 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:29:31,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:29:31,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:31,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:29:31,552 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 02:29:31,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 14291, now seen corresponding path program 1 times [2023-11-29 02:29:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232523410] [2023-11-29 02:29:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:31,568 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 02:29:31,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:31,588 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:31,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:31,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:31,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:31,763 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 02:29:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:31,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:31,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232523410] [2023-11-29 02:29:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232523410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:31,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:31,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131943513] [2023-11-29 02:29:31,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:31,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:31,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:31,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:31,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:29:31,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:31,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:31,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:29:31,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:33,332 INFO L124 PetriNetUnfolderBase]: 4217/7238 cut-off events. [2023-11-29 02:29:33,332 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 02:29:33,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13165 conditions, 7238 events. 4217/7238 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53851 event pairs, 3179 based on Foata normal form. 360/6962 useless extension candidates. Maximal degree in co-relation 13150. Up to 4391 conditions per place. [2023-11-29 02:29:33,391 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-29 02:29:33,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 226 flow [2023-11-29 02:29:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:29:33,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 02:29:33,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:29:33,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:29:33,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:33,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:29:33,408 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 02:29:33,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:33,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:33,413 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:29:33,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 226 flow [2023-11-29 02:29:33,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:29:33,422 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 02:29:33,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:29:33,427 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 02:29:33,427 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 02:29:33,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:33,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:33,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:29:33,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:33,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:33,628 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 02:29:33,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 14292, now seen corresponding path program 1 times [2023-11-29 02:29:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:33,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854901676] [2023-11-29 02:29:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:33,630 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 02:29:33,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:33,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:33,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:33,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:29:33,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:33,722 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 02:29:33,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:33,735 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:33,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:33,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854901676] [2023-11-29 02:29:33,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854901676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:33,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:33,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:33,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482085865] [2023-11-29 02:29:33,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:33,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:33,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:33,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:29:33,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 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 02:29:33,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:33,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:29:33,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:34,727 INFO L124 PetriNetUnfolderBase]: 4217/7237 cut-off events. [2023-11-29 02:29:34,727 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:29:34,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 7237 events. 4217/7237 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53752 event pairs, 3179 based on Foata normal form. 1/6602 useless extension candidates. Maximal degree in co-relation 13330. Up to 4390 conditions per place. [2023-11-29 02:29:34,782 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 35 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 02:29:34,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 222 flow [2023-11-29 02:29:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 02:29:34,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 02:29:34,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 02:29:34,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 02:29:34,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:34,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 02:29:34,787 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 02:29:34,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:34,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:34,789 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-29 02:29:34,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 222 flow [2023-11-29 02:29:34,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:34,798 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 02:29:34,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:29:34,799 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 02:29:34,799 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 02:29:34,799 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 02:29:34,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:34,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:29:34,854 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:35,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:35,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:29:35,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash 426185003, now seen corresponding path program 1 times [2023-11-29 02:29:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56663892] [2023-11-29 02:29:35,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:35,006 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 02:29:35,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:35,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:35,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:35,091 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:29:35,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:35,104 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:35,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56663892] [2023-11-29 02:29:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56663892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:29:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491943609] [2023-11-29 02:29:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:35,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:35,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 02:29:35,107 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.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 02:29:35,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:35,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 02:29:35,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:35,911 INFO L124 PetriNetUnfolderBase]: 3311/5478 cut-off events. [2023-11-29 02:29:35,912 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-11-29 02:29:35,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 5478 events. 3311/5478 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 39262 event pairs, 593 based on Foata normal form. 0/5401 useless extension candidates. Maximal degree in co-relation 10289. Up to 3661 conditions per place. [2023-11-29 02:29:35,952 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 41 selfloop transitions, 2 changer transitions 2/76 dead transitions. [2023-11-29 02:29:35,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 262 flow [2023-11-29 02:29:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-29 02:29:35,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7929292929292929 [2023-11-29 02:29:35,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-29 02:29:35,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-29 02:29:35,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:35,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-29 02:29:35,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:35,959 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 157 transitions. [2023-11-29 02:29:35,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 262 flow [2023-11-29 02:29:35,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 76 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:35,962 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 122 flow [2023-11-29 02:29:35,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=122, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2023-11-29 02:29:35,963 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 02:29:35,964 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 122 flow [2023-11-29 02:29:35,964 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 02:29:35,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:35,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:29:35,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:36,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:36,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:29:36,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 426183891, now seen corresponding path program 1 times [2023-11-29 02:29:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871053707] [2023-11-29 02:29:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:36,167 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 02:29:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:36,168 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:36,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:36,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:36,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:36,260 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 02:29:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:36,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:36,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:36,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871053707] [2023-11-29 02:29:36,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871053707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:36,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:36,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:36,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902042992] [2023-11-29 02:29:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:36,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:36,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:36,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:29:36,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:36,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:36,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:29:36,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:36,938 INFO L124 PetriNetUnfolderBase]: 2906/5134 cut-off events. [2023-11-29 02:29:36,938 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-29 02:29:36,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9546 conditions, 5134 events. 2906/5134 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37402 event pairs, 2290 based on Foata normal form. 0/4885 useless extension candidates. Maximal degree in co-relation 9535. Up to 3466 conditions per place. [2023-11-29 02:29:36,966 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 02:29:36,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-29 02:29:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:36,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:29:36,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:29:36,968 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:29:36,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:29:36,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:36,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:29:36,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:36,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:36,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:36,970 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 122 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:29:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-29 02:29:36,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:36,972 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 02:29:36,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-29 02:29:36,973 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 02:29:36,973 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 02:29:36,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:36,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:36,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:29:36,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:37,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:37,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:29:37,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash 426183892, now seen corresponding path program 1 times [2023-11-29 02:29:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:37,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539991840] [2023-11-29 02:29:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:37,176 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 02:29:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:37,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:37,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:29:37,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:37,270 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 02:29:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:37,279 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:37,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:37,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539991840] [2023-11-29 02:29:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539991840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:37,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:37,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331871651] [2023-11-29 02:29:37,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:37,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:37,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:37,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:37,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:37,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:29:37,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 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 02:29:37,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:37,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:29:37,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:38,000 INFO L124 PetriNetUnfolderBase]: 2903/5126 cut-off events. [2023-11-29 02:29:38,000 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:29:38,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9399 conditions, 5126 events. 2903/5126 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 37335 event pairs, 2288 based on Foata normal form. 4/4881 useless extension candidates. Maximal degree in co-relation 9389. Up to 3459 conditions per place. [2023-11-29 02:29:38,024 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 02:29:38,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 206 flow [2023-11-29 02:29:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:29:38,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 02:29:38,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:29:38,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:29:38,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:38,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:29:38,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,028 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:29:38,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 206 flow [2023-11-29 02:29:38,032 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 02:29:38,033 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 02:29:38,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:29:38,034 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 02:29:38,034 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 02:29:38,035 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 02:29:38,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:38,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:38,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:38,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:38,236 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 02:29:38,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash 521406692, now seen corresponding path program 1 times [2023-11-29 02:29:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:38,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170528480] [2023-11-29 02:29:38,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:38,237 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 02:29:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:38,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:38,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:38,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:38,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:38,320 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 02:29:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:38,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:38,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170528480] [2023-11-29 02:29:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170528480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906159827] [2023-11-29 02:29:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:38,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:29:38,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:38,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:29:38,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:38,863 INFO L124 PetriNetUnfolderBase]: 2920/5121 cut-off events. [2023-11-29 02:29:38,863 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:29:38,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 5121 events. 2920/5121 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 37030 event pairs, 1892 based on Foata normal form. 0/4895 useless extension candidates. Maximal degree in co-relation 9413. Up to 3460 conditions per place. [2023-11-29 02:29:38,890 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 02:29:38,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 206 flow [2023-11-29 02:29:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:29:38,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:29:38,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:29:38,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:29:38,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:38,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:29:38,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,894 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:29:38,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 206 flow [2023-11-29 02:29:38,897 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 02:29:38,898 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 02:29:38,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:29:38,899 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 02:29:38,899 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 02:29:38,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:38,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:38,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:38,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:29:39,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:39,103 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 02:29:39,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 521406693, now seen corresponding path program 1 times [2023-11-29 02:29:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29071418] [2023-11-29 02:29:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:39,104 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 02:29:39,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:39,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:39,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:39,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:29:39,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:39,196 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 02:29:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:39,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:39,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29071418] [2023-11-29 02:29:39,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29071418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:39,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:39,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:39,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464650139] [2023-11-29 02:29:39,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:39,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:39,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:39,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:29:39,246 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.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 02:29:39,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:39,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:29:39,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:39,758 INFO L124 PetriNetUnfolderBase]: 2903/5092 cut-off events. [2023-11-29 02:29:39,758 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:29:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9373 conditions, 5092 events. 2903/5092 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 36764 event pairs, 1884 based on Foata normal form. 12/4886 useless extension candidates. Maximal degree in co-relation 9363. Up to 3431 conditions per place. [2023-11-29 02:29:39,781 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 02:29:39,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 202 flow [2023-11-29 02:29:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:39,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:29:39,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 02:29:39,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:29:39,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:29:39,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:39,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:29:39,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:39,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:39,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:39,785 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:29:39,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 202 flow [2023-11-29 02:29:39,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:39,788 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 02:29:39,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:29:39,789 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 02:29:39,789 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 02:29:39,789 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 02:29:39,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:39,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:39,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:39,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:39,990 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 02:29:39,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1669512474, now seen corresponding path program 1 times [2023-11-29 02:29:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:39,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509953183] [2023-11-29 02:29:39,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:39,991 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 02:29:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:39,992 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:39,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:40,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:40,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:40,103 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 02:29:40,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:40,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:40,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:40,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509953183] [2023-11-29 02:29:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509953183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:40,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99210554] [2023-11-29 02:29:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:40,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:40,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:40,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:40,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:40,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 02:29:40,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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 02:29:40,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:40,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 02:29:40,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:40,709 INFO L124 PetriNetUnfolderBase]: 2978/5123 cut-off events. [2023-11-29 02:29:40,709 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:29:40,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 5123 events. 2978/5123 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 36550 event pairs, 1424 based on Foata normal form. 0/4969 useless extension candidates. Maximal degree in co-relation 9505. Up to 3426 conditions per place. [2023-11-29 02:29:40,732 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 02:29:40,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 202 flow [2023-11-29 02:29:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:29:40,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7121212121212122 [2023-11-29 02:29:40,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:29:40,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:29:40,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:40,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:29:40,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:40,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:40,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:40,735 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:29:40,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 202 flow [2023-11-29 02:29:40,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:40,738 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 02:29:40,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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 02:29:40,739 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 02:29:40,740 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 02:29:40,740 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 02:29:40,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:40,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:40,743 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:40,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:40,941 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 02:29:40,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1669512473, now seen corresponding path program 1 times [2023-11-29 02:29:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95604115] [2023-11-29 02:29:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:40,942 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 02:29:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:40,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:40,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:41,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:29:41,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:41,051 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 02:29:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:41,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:41,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95604115] [2023-11-29 02:29:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95604115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:41,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:41,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598561634] [2023-11-29 02:29:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:41,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:41,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:41,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:41,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:41,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:29:41,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 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 02:29:41,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:41,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:29:41,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:41,838 INFO L124 PetriNetUnfolderBase]: 2903/5072 cut-off events. [2023-11-29 02:29:41,838 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:29:41,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9377 conditions, 5072 events. 2903/5072 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 36425 event pairs, 920 based on Foata normal form. 36/4990 useless extension candidates. Maximal degree in co-relation 9367. Up to 3315 conditions per place. [2023-11-29 02:29:41,871 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 02:29:41,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 198 flow [2023-11-29 02:29:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:29:41,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-29 02:29:41,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:29:41,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:29:41,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:41,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:29:41,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:41,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:41,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:41,875 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:29:41,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 198 flow [2023-11-29 02:29:41,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:41,877 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 02:29:41,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 02:29:41,878 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -13 predicate places. [2023-11-29 02:29:41,879 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 02:29:41,879 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 02:29:41,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:41,879 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 02:29:41,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:42,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:42,080 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 02:29:42,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1158839862, now seen corresponding path program 1 times [2023-11-29 02:29:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726943833] [2023-11-29 02:29:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:42,081 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 02:29:42,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:42,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:42,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:29:42,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:42,221 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:42,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:42,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726943833] [2023-11-29 02:29:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726943833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:42,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:42,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:29:42,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330198304] [2023-11-29 02:29:42,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:42,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:29:42,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:42,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:29:42,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:29:42,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:29:42,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:42,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:42,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:29:42,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:43,643 INFO L124 PetriNetUnfolderBase]: 9971/15473 cut-off events. [2023-11-29 02:29:43,643 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 02:29:43,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29698 conditions, 15473 events. 9971/15473 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 111742 event pairs, 1033 based on Foata normal form. 400/15729 useless extension candidates. Maximal degree in co-relation 29688. Up to 8761 conditions per place. [2023-11-29 02:29:43,705 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 1/81 dead transitions. [2023-11-29 02:29:43,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 81 transitions, 304 flow [2023-11-29 02:29:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:29:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:29:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2023-11-29 02:29:43,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7234848484848485 [2023-11-29 02:29:43,707 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 191 transitions. [2023-11-29 02:29:43,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 191 transitions. [2023-11-29 02:29:43,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:43,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 191 transitions. [2023-11-29 02:29:43,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,708 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,708 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 4 states and 191 transitions. [2023-11-29 02:29:43,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 81 transitions, 304 flow [2023-11-29 02:29:43,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 81 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:43,718 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 148 flow [2023-11-29 02:29:43,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-29 02:29:43,718 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 02:29:43,719 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 148 flow [2023-11-29 02:29:43,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:43,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:43,719 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 02:29:43,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:43,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:43,920 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 02:29:43,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:43,920 INFO L85 PathProgramCache]: Analyzing trace with hash 190530853, now seen corresponding path program 1 times [2023-11-29 02:29:43,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:43,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106229290] [2023-11-29 02:29:43,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:43,921 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 02:29:43,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:43,922 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:43,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:44,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:29:44,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:44,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:44,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:44,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106229290] [2023-11-29 02:29:44,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106229290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:44,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:44,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:29:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082523847] [2023-11-29 02:29:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:44,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:29:44,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:44,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:44,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:29:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:45,125 INFO L124 PetriNetUnfolderBase]: 7427/11573 cut-off events. [2023-11-29 02:29:45,125 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-29 02:29:45,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25501 conditions, 11573 events. 7427/11573 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 79288 event pairs, 451 based on Foata normal form. 364/11804 useless extension candidates. Maximal degree in co-relation 25488. Up to 5521 conditions per place. [2023-11-29 02:29:45,172 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 69 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2023-11-29 02:29:45,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 431 flow [2023-11-29 02:29:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:29:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:29:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2023-11-29 02:29:45,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:29:45,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 242 transitions. [2023-11-29 02:29:45,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 242 transitions. [2023-11-29 02:29:45,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:45,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 242 transitions. [2023-11-29 02:29:45,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:45,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:45,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:45,176 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 148 flow. Second operand 5 states and 242 transitions. [2023-11-29 02:29:45,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 431 flow [2023-11-29 02:29:45,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:45,179 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 200 flow [2023-11-29 02:29:45,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-29 02:29:45,180 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 02:29:45,181 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 200 flow [2023-11-29 02:29:45,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:45,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:45,181 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 02:29:45,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:45,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:45,381 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 02:29:45,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1964038621, now seen corresponding path program 1 times [2023-11-29 02:29:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:45,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428022618] [2023-11-29 02:29:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:45,382 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 02:29:45,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:45,383 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:45,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:45,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:29:45,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:45,563 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:45,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:45,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428022618] [2023-11-29 02:29:45,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428022618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:45,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:45,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:45,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421427723] [2023-11-29 02:29:45,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:45,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:45,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:45,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:45,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:45,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:29:45,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:45,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:45,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:29:45,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:46,393 INFO L124 PetriNetUnfolderBase]: 4491/6889 cut-off events. [2023-11-29 02:29:46,393 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-29 02:29:46,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17123 conditions, 6889 events. 4491/6889 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 41059 event pairs, 289 based on Foata normal form. 244/7011 useless extension candidates. Maximal degree in co-relation 17108. Up to 1969 conditions per place. [2023-11-29 02:29:46,422 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 82 selfloop transitions, 14 changer transitions 1/117 dead transitions. [2023-11-29 02:29:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 117 transitions, 562 flow [2023-11-29 02:29:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:29:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:29:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2023-11-29 02:29:46,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7348484848484849 [2023-11-29 02:29:46,424 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 291 transitions. [2023-11-29 02:29:46,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 291 transitions. [2023-11-29 02:29:46,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:46,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 291 transitions. [2023-11-29 02:29:46,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:46,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:46,426 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:46,427 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 200 flow. Second operand 6 states and 291 transitions. [2023-11-29 02:29:46,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 117 transitions, 562 flow [2023-11-29 02:29:46,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 532 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 02:29:46,450 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 250 flow [2023-11-29 02:29:46,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 02:29:46,451 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 02:29:46,451 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 250 flow [2023-11-29 02:29:46,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.166666666666664) internal successors, (211), 6 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:46,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:46,451 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] [2023-11-29 02:29:46,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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)] Ended with exit code 0 [2023-11-29 02:29:46,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:46,652 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 02:29:46,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2111306923, now seen corresponding path program 1 times [2023-11-29 02:29:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:46,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81066677] [2023-11-29 02:29:46,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:46,653 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 02:29:46,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:46,654 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:46,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:46,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:29:46,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:46,836 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:46,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:46,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81066677] [2023-11-29 02:29:46,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81066677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:46,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061056913] [2023-11-29 02:29:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:46,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:29:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:29:46,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:29:46,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 66 [2023-11-29 02:29:46,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:46,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:46,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 66 [2023-11-29 02:29:46,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:47,483 INFO L124 PetriNetUnfolderBase]: 2927/4297 cut-off events. [2023-11-29 02:29:47,483 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2023-11-29 02:29:47,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 4297 events. 2927/4297 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 22480 event pairs, 231 based on Foata normal form. 96/4271 useless extension candidates. Maximal degree in co-relation 11804. Up to 1316 conditions per place. [2023-11-29 02:29:47,501 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 73 selfloop transitions, 18 changer transitions 1/112 dead transitions. [2023-11-29 02:29:47,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 552 flow [2023-11-29 02:29:47,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:29:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 318 transitions. [2023-11-29 02:29:47,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2023-11-29 02:29:47,503 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 318 transitions. [2023-11-29 02:29:47,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 318 transitions. [2023-11-29 02:29:47,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:47,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 318 transitions. [2023-11-29 02:29:47,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.42857142857143) internal successors, (318), 7 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:47,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:47,506 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:47,506 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 250 flow. Second operand 7 states and 318 transitions. [2023-11-29 02:29:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 552 flow [2023-11-29 02:29:47,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 506 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 02:29:47,543 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 260 flow [2023-11-29 02:29:47,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-11-29 02:29:47,544 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 02:29:47,544 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 260 flow [2023-11-29 02:29:47,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:47,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:47,544 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] [2023-11-29 02:29:47,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:47,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:47,745 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 02:29:47,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash -196299898, now seen corresponding path program 1 times [2023-11-29 02:29:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884958947] [2023-11-29 02:29:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:47,745 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 02:29:47,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:47,746 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:47,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 02:29:47,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:48,691 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t770~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t771~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t772~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t769~0#1.base_49| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t769~0#1.base_49| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t770~0#1.base_45| (_ bv1 1)))) (and (= (select (store .cse0 |v_ULTIMATE.start_main_~#t771~0#1.base_41| (_ bv1 1)) |v_ULTIMATE.start_main_~#t772~0#1.base_41|) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t769~0#1.base_49|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t771~0#1.base_41|)) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t770~0#1.base_45|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t769~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t770~0#1.base_45| (_ bv0 1)) |v_ULTIMATE.start_main_~#t771~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t772~0#1.base_41| (_ bv0 1)) |c_#valid|))))) is different from true [2023-11-29 02:29:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:48,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:48,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884958947] [2023-11-29 02:29:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884958947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:48,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:48,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654220034] [2023-11-29 02:29:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:48,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:29:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:48,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:29:48,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 02:29:48,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2023-11-29 02:29:48,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 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 02:29:48,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:48,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2023-11-29 02:29:48,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:49,390 INFO L124 PetriNetUnfolderBase]: 1598/2809 cut-off events. [2023-11-29 02:29:49,390 INFO L125 PetriNetUnfolderBase]: For 1167/1263 co-relation queries the response was YES. [2023-11-29 02:29:49,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6355 conditions, 2809 events. 1598/2809 cut-off events. For 1167/1263 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 17110 event pairs, 584 based on Foata normal form. 16/2636 useless extension candidates. Maximal degree in co-relation 6337. Up to 1876 conditions per place. [2023-11-29 02:29:49,404 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 43 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2023-11-29 02:29:49,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 84 transitions, 410 flow [2023-11-29 02:29:49,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:29:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2023-11-29 02:29:49,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47835497835497837 [2023-11-29 02:29:49,406 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 221 transitions. [2023-11-29 02:29:49,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 221 transitions. [2023-11-29 02:29:49,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:49,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 221 transitions. [2023-11-29 02:29:49,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 31.571428571428573) internal successors, (221), 7 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:49,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:49,408 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:49,408 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 260 flow. Second operand 7 states and 221 transitions. [2023-11-29 02:29:49,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 84 transitions, 410 flow [2023-11-29 02:29:49,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 314 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 02:29:49,420 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 205 flow [2023-11-29 02:29:49,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2023-11-29 02:29:49,420 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 02:29:49,420 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 205 flow [2023-11-29 02:29:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.428571428571427) internal successors, (192), 7 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 02:29:49,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:49,421 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] [2023-11-29 02:29:49,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:49,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:49,621 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 02:29:49,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:49,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2118870925, now seen corresponding path program 1 times [2023-11-29 02:29:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589431076] [2023-11-29 02:29:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:49,622 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 02:29:49,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:49,623 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:49,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:49,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 02:29:49,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:50,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:50,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589431076] [2023-11-29 02:29:50,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589431076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:50,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:29:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284772916] [2023-11-29 02:29:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:50,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:29:50,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:50,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:29:50,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:29:50,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 02:29:50,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 205 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:50,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:50,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 02:29:50,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:51,128 INFO L124 PetriNetUnfolderBase]: 2271/3801 cut-off events. [2023-11-29 02:29:51,128 INFO L125 PetriNetUnfolderBase]: For 1167/1391 co-relation queries the response was YES. [2023-11-29 02:29:51,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 3801 events. 2271/3801 cut-off events. For 1167/1391 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23645 event pairs, 439 based on Foata normal form. 16/3585 useless extension candidates. Maximal degree in co-relation 9099. Up to 1499 conditions per place. [2023-11-29 02:29:51,146 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 78 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2023-11-29 02:29:51,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 580 flow [2023-11-29 02:29:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:29:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 404 transitions. [2023-11-29 02:29:51,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6801346801346801 [2023-11-29 02:29:51,148 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 404 transitions. [2023-11-29 02:29:51,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 404 transitions. [2023-11-29 02:29:51,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:51,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 404 transitions. [2023-11-29 02:29:51,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:51,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:51,152 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 66.0) internal successors, (660), 10 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:51,152 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 205 flow. Second operand 9 states and 404 transitions. [2023-11-29 02:29:51,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 580 flow [2023-11-29 02:29:51,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 123 transitions, 550 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:29:51,156 INFO L231 Difference]: Finished difference. Result has 77 places, 70 transitions, 242 flow [2023-11-29 02:29:51,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2023-11-29 02:29:51,157 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2023-11-29 02:29:51,157 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 242 flow [2023-11-29 02:29:51,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:51,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:51,157 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] [2023-11-29 02:29:51,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:51,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:51,358 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 02:29:51,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1031547427, now seen corresponding path program 2 times [2023-11-29 02:29:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138125263] [2023-11-29 02:29:51,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:29:51,359 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 02:29:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:51,360 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:51,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:51,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 02:29:51,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:29:51,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:29:51,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:51,540 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:51,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138125263] [2023-11-29 02:29:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138125263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739402465] [2023-11-29 02:29:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:51,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:51,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 02:29:51,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 242 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 02:29:51,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:51,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 02:29:51,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:52,467 INFO L124 PetriNetUnfolderBase]: 5098/8301 cut-off events. [2023-11-29 02:29:52,467 INFO L125 PetriNetUnfolderBase]: For 3453/3815 co-relation queries the response was YES. [2023-11-29 02:29:52,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20924 conditions, 8301 events. 5098/8301 cut-off events. For 3453/3815 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 55446 event pairs, 1675 based on Foata normal form. 16/7903 useless extension candidates. Maximal degree in co-relation 20907. Up to 3418 conditions per place. [2023-11-29 02:29:52,514 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 79 selfloop transitions, 8 changer transitions 0/121 dead transitions. [2023-11-29 02:29:52,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 610 flow [2023-11-29 02:29:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:29:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:29:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2023-11-29 02:29:52,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2023-11-29 02:29:52,516 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 273 transitions. [2023-11-29 02:29:52,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 273 transitions. [2023-11-29 02:29:52,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:52,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 273 transitions. [2023-11-29 02:29:52,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:52,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:52,518 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:52,518 INFO L175 Difference]: Start difference. First operand has 77 places, 70 transitions, 242 flow. Second operand 6 states and 273 transitions. [2023-11-29 02:29:52,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 610 flow [2023-11-29 02:29:52,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 121 transitions, 599 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 02:29:52,534 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 319 flow [2023-11-29 02:29:52,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-11-29 02:29:52,535 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 10 predicate places. [2023-11-29 02:29:52,535 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 319 flow [2023-11-29 02:29:52,535 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 02:29:52,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:52,535 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] [2023-11-29 02:29:52,539 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:52,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:52,736 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 02:29:52,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:52,736 INFO L85 PathProgramCache]: Analyzing trace with hash 496599389, now seen corresponding path program 3 times [2023-11-29 02:29:52,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587803052] [2023-11-29 02:29:52,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:29:52,737 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 02:29:52,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:52,738 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:52,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:52,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 02:29:52,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:29:52,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:29:52,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:29:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:29:52,885 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:29:52,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:29:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587803052] [2023-11-29 02:29:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587803052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:52,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431158331] [2023-11-29 02:29:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:52,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:29:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:29:52,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:29:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:29:52,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 02:29:52,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 319 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 02:29:52,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:52,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 02:29:52,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:54,173 INFO L124 PetriNetUnfolderBase]: 8997/14611 cut-off events. [2023-11-29 02:29:54,173 INFO L125 PetriNetUnfolderBase]: For 6970/7278 co-relation queries the response was YES. [2023-11-29 02:29:54,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37269 conditions, 14611 events. 8997/14611 cut-off events. For 6970/7278 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 107434 event pairs, 3261 based on Foata normal form. 16/13672 useless extension candidates. Maximal degree in co-relation 37249. Up to 5995 conditions per place. [2023-11-29 02:29:54,265 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 70 selfloop transitions, 14 changer transitions 0/119 dead transitions. [2023-11-29 02:29:54,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 119 transitions, 697 flow [2023-11-29 02:29:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:29:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:29:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-11-29 02:29:54,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6818181818181818 [2023-11-29 02:29:54,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 225 transitions. [2023-11-29 02:29:54,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 225 transitions. [2023-11-29 02:29:54,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:54,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 225 transitions. [2023-11-29 02:29:54,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:54,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:54,268 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:54,268 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 319 flow. Second operand 5 states and 225 transitions. [2023-11-29 02:29:54,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 119 transitions, 697 flow [2023-11-29 02:29:54,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 119 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:29:54,292 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 506 flow [2023-11-29 02:29:54,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-11-29 02:29:54,293 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2023-11-29 02:29:54,293 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 506 flow [2023-11-29 02:29:54,293 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 02:29:54,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:54,293 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] [2023-11-29 02:29:54,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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)] Ended with exit code 0 [2023-11-29 02:29:54,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:54,494 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 02:29:54,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:54,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1419267857, now seen corresponding path program 4 times [2023-11-29 02:29:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:29:54,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333528674] [2023-11-29 02:29:54,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:29:54,494 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 02:29:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:29:54,495 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:54,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:54,639 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:29:54,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 02:29:54,639 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:29:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:29:54,784 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 02:29:54,784 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:29:54,785 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 02:29:54,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 02:29:54,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 02:29:54,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 02:29:54,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 02:29:54,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 02:29:54,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 02:29:54,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 02:29:54,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 02:29:54,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 02:29:54,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 02:29:54,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 02:29:54,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 02:29:54,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 02:29:54,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 02:29:54,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 02:29:54,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:54,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/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 02:29:54,995 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:55,000 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:29:55,000 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:29:55,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:29:55,066 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:29:55,071 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:29:55,072 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:29:55,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:29:55,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:29:55,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:29:55 BasicIcfg [2023-11-29 02:29:55,101 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:29:55,101 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:29:55,101 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:29:55,102 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:29:55,102 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:29:31" (3/4) ... [2023-11-29 02:29:55,104 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:29:55,105 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:29:55,105 INFO L158 Benchmark]: Toolchain (without parser) took 25259.71ms. Allocated memory was 79.7MB in the beginning and 1.3GB in the end (delta: 1.3GB). Free memory was 47.3MB in the beginning and 591.4MB in the end (delta: -544.1MB). Peak memory consumption was 717.4MB. Max. memory is 16.1GB. [2023-11-29 02:29:55,106 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 52.4MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:55,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.95ms. Allocated memory is still 79.7MB. Free memory was 47.0MB in the beginning and 39.4MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 02:29:55,106 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.27ms. Allocated memory is still 79.7MB. Free memory was 39.4MB in the beginning and 36.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:29:55,107 INFO L158 Benchmark]: Boogie Preprocessor took 66.32ms. Allocated memory is still 79.7MB. Free memory was 36.7MB in the beginning and 54.2MB in the end (delta: -17.5MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-11-29 02:29:55,107 INFO L158 Benchmark]: RCFGBuilder took 840.58ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 54.2MB in the beginning and 61.7MB in the end (delta: -7.6MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2023-11-29 02:29:55,107 INFO L158 Benchmark]: TraceAbstraction took 23750.24ms. Allocated memory was 96.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 61.1MB in the beginning and 591.4MB in the end (delta: -530.3MB). Peak memory consumption was 715.2MB. Max. memory is 16.1GB. [2023-11-29 02:29:55,107 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 1.3GB. Free memory is still 591.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:29:55,109 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.24ms. Allocated memory is still 52.4MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.95ms. Allocated memory is still 79.7MB. Free memory was 47.0MB in the beginning and 39.4MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.27ms. Allocated memory is still 79.7MB. Free memory was 39.4MB in the beginning and 36.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.32ms. Allocated memory is still 79.7MB. Free memory was 36.7MB in the beginning and 54.2MB in the end (delta: -17.5MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * RCFGBuilder took 840.58ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 54.2MB in the beginning and 61.7MB in the end (delta: -7.6MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * TraceAbstraction took 23750.24ms. Allocated memory was 96.5MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 61.1MB in the beginning and 591.4MB in the end (delta: -530.3MB). Peak memory consumption was 715.2MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 1.3GB. Free memory is still 591.4MB. 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_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={3:0}, t770={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0] [L786] 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) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 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 [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 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_p0_EAX=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=1, y=1, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={3:0}, t770={5:0}, t771={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, t769={3:0}, t770={5:0}, t771={7:0}, t772={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=2, z=1] [L806] 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) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 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 [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 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_p0_EAX=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=2, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 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) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=2, z=2] [L766] 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) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 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 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 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_p0_EAX=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=1, y=2, z=2] [L842] 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) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 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 [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 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_p0_EAX=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=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=1, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=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=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, y=2, z=2] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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, t769={3:0}, t770={5:0}, t771={7:0}, t772={-2147483645:0}, weak$$choice2=0, x=1, y=2, z=2] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 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 [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 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_p0_EAX=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, t769={3:0}, t770={5:0}, t771={7:0}, t772={-2147483645:0}, weak$$choice2=0, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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, t769={3:0}, t770={5:0}, t771={7:0}, t772={-2147483645:0}, weak$$choice2=0, x=1, y=2, z=2] [L886] 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_p0_EAX=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=1, y=2, z=2] [L17] 0 __assert_fail ("0", "mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=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=1, y=2, 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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 867]: 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: 869]: 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: 871]: 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, 99 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: 23.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 917 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 763 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2390 IncrementalHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 34 mSDtfsCounter, 2390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=17, InterpolantAutomatonStates: 76, 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, 0.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 322 ConstructedInterpolants, 1 QuantifiedInterpolants, 2774 SizeOfPredicates, 14 NumberOfNonLiveVariables, 2310 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 02:29:55,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a37da928-d70f-41d2-a4ee-4579cd04da65/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample