./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:48:40,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:48:40,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:48:40,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:48:40,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:48:40,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:48:40,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:48:40,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:48:40,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:48:40,546 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:48:40,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:48:40,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:48:40,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:48:40,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:48:40,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:48:40,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:48:40,551 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:48:40,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:48:40,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:48:40,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:48:40,552 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:48:40,552 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:48:40,556 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:48:40,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:48:40,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:48:40,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:48:40,557 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:48:40,557 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:48:40,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:48:40,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:48:40,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:48:40,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:48:40,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:48:40,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:48:40,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:48:40,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:48:40,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:48:40,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:48:40,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:48:40,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:48:40,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:48:40,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:48:40,562 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2024-11-19 09:48:40,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:48:40,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:48:40,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:48:40,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:48:40,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:48:40,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-11-19 09:48:42,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:48:42,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:48:42,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-11-19 09:48:42,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a42eb6ad/31384649b12d43a68d0dc647b6f7abe5/FLAG373eb807d [2024-11-19 09:48:42,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a42eb6ad/31384649b12d43a68d0dc647b6f7abe5 [2024-11-19 09:48:42,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:48:42,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:48:42,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:48:42,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:48:42,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:48:42,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:42" (1/1) ... [2024-11-19 09:48:42,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e0184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:42, skipping insertion in model container [2024-11-19 09:48:42,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:42" (1/1) ... [2024-11-19 09:48:42,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:48:43,211 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:48:43,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:48:43,233 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:48:43,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:48:43,301 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:48:43,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43 WrapperNode [2024-11-19 09:48:43,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:48:43,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:48:43,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:48:43,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:48:43,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,352 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 309 [2024-11-19 09:48:43,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:48:43,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:48:43,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:48:43,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:48:43,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,394 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-19 09:48:43,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:48:43,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:48:43,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:48:43,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:48:43,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (1/1) ... [2024-11-19 09:48:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:48:43,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:43,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:48:43,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:48:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:48:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:48:43,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:48:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:48:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:48:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:48:43,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:48:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 09:48:43,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 09:48:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:48:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:48:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:48:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:48:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:48:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:48:43,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:48:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:48:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:48:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:48:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:48:43,528 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:48:43,693 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:48:43,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:48:44,275 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:48:44,276 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:48:44,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:48:44,703 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 09:48:44,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:44 BoogieIcfgContainer [2024-11-19 09:48:44,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:48:44,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:48:44,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:48:44,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:48:44,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:48:42" (1/3) ... [2024-11-19 09:48:44,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604844d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:44, skipping insertion in model container [2024-11-19 09:48:44,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:43" (2/3) ... [2024-11-19 09:48:44,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604844d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:44, skipping insertion in model container [2024-11-19 09:48:44,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:44" (3/3) ... [2024-11-19 09:48:44,714 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-11-19 09:48:44,733 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:48:44,733 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 09:48:44,734 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:48:44,857 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 09:48:44,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2024-11-19 09:48:44,933 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2024-11-19 09:48:44,933 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:48:44,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 132 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-19 09:48:44,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2024-11-19 09:48:44,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2024-11-19 09:48:44,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:48:44,966 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5de088c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:48:44,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-19 09:48:44,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:48:44,974 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:48:44,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:48:44,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:44,975 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:48:44,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:44,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 888770, now seen corresponding path program 1 times [2024-11-19 09:48:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:44,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68602423] [2024-11-19 09:48:44,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:45,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68602423] [2024-11-19 09:48:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68602423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:45,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:45,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:48:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702374886] [2024-11-19 09:48:45,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:45,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:48:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:48:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:48:45,383 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:45,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:45,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:45,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:45,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:46,456 INFO L124 PetriNetUnfolderBase]: 4566/6759 cut-off events. [2024-11-19 09:48:46,456 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2024-11-19 09:48:46,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13365 conditions, 6759 events. 4566/6759 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 49968 event pairs, 4408 based on Foata normal form. 1/3822 useless extension candidates. Maximal degree in co-relation 12180. Up to 6127 conditions per place. [2024-11-19 09:48:46,531 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-19 09:48:46,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 206 flow [2024-11-19 09:48:46,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:48:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:48:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-11-19 09:48:46,545 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-11-19 09:48:46,547 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 111 transitions. [2024-11-19 09:48:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 206 flow [2024-11-19 09:48:46,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 190 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:48:46,568 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2024-11-19 09:48:46,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-11-19 09:48:46,575 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-11-19 09:48:46,576 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2024-11-19 09:48:46,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:46,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:46,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:48:46,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:48:46,577 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:46,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:46,578 INFO L85 PathProgramCache]: Analyzing trace with hash 888771, now seen corresponding path program 1 times [2024-11-19 09:48:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:46,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314752298] [2024-11-19 09:48:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:46,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:46,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:46,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314752298] [2024-11-19 09:48:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314752298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:46,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974751959] [2024-11-19 09:48:46,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:46,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:46,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:46,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:46,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:46,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:46,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:47,825 INFO L124 PetriNetUnfolderBase]: 4566/6758 cut-off events. [2024-11-19 09:48:47,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:48:47,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13052 conditions, 6758 events. 4566/6758 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 49988 event pairs, 4408 based on Foata normal form. 0/3820 useless extension candidates. Maximal degree in co-relation 13031. Up to 6131 conditions per place. [2024-11-19 09:48:47,891 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 33 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-11-19 09:48:47,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 194 flow [2024-11-19 09:48:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-19 09:48:47,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-11-19 09:48:47,896 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 134 transitions. [2024-11-19 09:48:47,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 194 flow [2024-11-19 09:48:47,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:47,898 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 124 flow [2024-11-19 09:48:47,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-11-19 09:48:47,901 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-11-19 09:48:47,901 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 124 flow [2024-11-19 09:48:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:47,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:47,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:48:47,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:48:47,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:47,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 27553988, now seen corresponding path program 1 times [2024-11-19 09:48:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:47,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520240001] [2024-11-19 09:48:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:48,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520240001] [2024-11-19 09:48:48,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520240001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:48,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:48,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:48:48,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662981954] [2024-11-19 09:48:48,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:48,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:48,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:48,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:48,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:48,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:48,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:48,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:48,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:48,967 INFO L124 PetriNetUnfolderBase]: 4568/6764 cut-off events. [2024-11-19 09:48:48,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:48:48,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13069 conditions, 6764 events. 4568/6764 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 49992 event pairs, 4408 based on Foata normal form. 0/3823 useless extension candidates. Maximal degree in co-relation 13045. Up to 6134 conditions per place. [2024-11-19 09:48:49,027 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 36 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2024-11-19 09:48:49,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 228 flow [2024-11-19 09:48:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:48:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:48:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2024-11-19 09:48:49,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125 [2024-11-19 09:48:49,031 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 124 flow. Second operand 5 states and 164 transitions. [2024-11-19 09:48:49,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 228 flow [2024-11-19 09:48:49,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:48:49,034 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 169 flow [2024-11-19 09:48:49,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2024-11-19 09:48:49,035 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-11-19 09:48:49,035 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 169 flow [2024-11-19 09:48:49,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:49,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:49,036 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-19 09:48:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:48:49,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 709606757, now seen corresponding path program 1 times [2024-11-19 09:48:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529100858] [2024-11-19 09:48:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:49,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529100858] [2024-11-19 09:48:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529100858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:49,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868114625] [2024-11-19 09:48:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:49,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:49,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:49,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:48:49,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:48:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:49,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 09:48:49,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:49,500 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 10 treesize of output 9 [2024-11-19 09:48:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:49,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868114625] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:49,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:49,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-19 09:48:49,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449916839] [2024-11-19 09:48:49,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:49,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:48:49,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:48:49,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:48:49,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:49,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 169 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:49,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:49,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:49,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:50,980 INFO L124 PetriNetUnfolderBase]: 4570/6769 cut-off events. [2024-11-19 09:48:50,980 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:48:50,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13101 conditions, 6769 events. 4570/6769 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 50144 event pairs, 4408 based on Foata normal form. 0/3831 useless extension candidates. Maximal degree in co-relation 13041. Up to 6128 conditions per place. [2024-11-19 09:48:51,030 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 30 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2024-11-19 09:48:51,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 287 flow [2024-11-19 09:48:51,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:48:51,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:48:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 266 transitions. [2024-11-19 09:48:51,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2024-11-19 09:48:51,033 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 169 flow. Second operand 9 states and 266 transitions. [2024-11-19 09:48:51,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 287 flow [2024-11-19 09:48:51,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:51,035 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 226 flow [2024-11-19 09:48:51,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=226, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-11-19 09:48:51,036 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-19 09:48:51,036 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 226 flow [2024-11-19 09:48:51,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:51,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:51,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:51,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:48:51,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:51,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:51,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -890472102, now seen corresponding path program 1 times [2024-11-19 09:48:51,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:51,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431881038] [2024-11-19 09:48:51,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:51,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431881038] [2024-11-19 09:48:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431881038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425933901] [2024-11-19 09:48:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:51,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:51,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:48:51,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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) [2024-11-19 09:48:51,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:51,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:48:51,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:52,149 INFO L124 PetriNetUnfolderBase]: 5237/7874 cut-off events. [2024-11-19 09:48:52,153 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 09:48:52,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15261 conditions, 7874 events. 5237/7874 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 59552 event pairs, 5051 based on Foata normal form. 249/4927 useless extension candidates. Maximal degree in co-relation 13045. Up to 6142 conditions per place. [2024-11-19 09:48:52,225 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 77 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2024-11-19 09:48:52,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 500 flow [2024-11-19 09:48:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-11-19 09:48:52,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68359375 [2024-11-19 09:48:52,227 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 226 flow. Second operand 4 states and 175 transitions. [2024-11-19 09:48:52,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 500 flow [2024-11-19 09:48:52,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 432 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-11-19 09:48:52,236 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 199 flow [2024-11-19 09:48:52,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2024-11-19 09:48:52,237 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2024-11-19 09:48:52,237 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 199 flow [2024-11-19 09:48:52,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 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) [2024-11-19 09:48:52,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:52,238 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:52,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:48:52,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1095779260, now seen corresponding path program 1 times [2024-11-19 09:48:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613463025] [2024-11-19 09:48:52,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:52,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:52,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613463025] [2024-11-19 09:48:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613463025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:48:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175817031] [2024-11-19 09:48:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:52,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:52,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:52,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:52,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:52,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:53,013 INFO L124 PetriNetUnfolderBase]: 3403/5266 cut-off events. [2024-11-19 09:48:53,013 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2024-11-19 09:48:53,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11408 conditions, 5266 events. 3403/5266 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 38779 event pairs, 3251 based on Foata normal form. 0/3395 useless extension candidates. Maximal degree in co-relation 9958. Up to 4639 conditions per place. [2024-11-19 09:48:53,069 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 42 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2024-11-19 09:48:53,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 287 flow [2024-11-19 09:48:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-19 09:48:53,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.515625 [2024-11-19 09:48:53,072 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 199 flow. Second operand 4 states and 132 transitions. [2024-11-19 09:48:53,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 287 flow [2024-11-19 09:48:53,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 283 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:53,075 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 199 flow [2024-11-19 09:48:53,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-11-19 09:48:53,076 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2024-11-19 09:48:53,077 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 199 flow [2024-11-19 09:48:53,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:53,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:53,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:53,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:48:53,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:53,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:53,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1095779259, now seen corresponding path program 1 times [2024-11-19 09:48:53,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:53,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743451733] [2024-11-19 09:48:53,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:53,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:53,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743451733] [2024-11-19 09:48:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743451733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:53,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:53,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:48:53,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535599349] [2024-11-19 09:48:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:53,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:53,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:53,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:53,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:48:53,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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) [2024-11-19 09:48:53,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:53,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:48:53,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:54,012 INFO L124 PetriNetUnfolderBase]: 4227/6777 cut-off events. [2024-11-19 09:48:54,013 INFO L125 PetriNetUnfolderBase]: For 548/548 co-relation queries the response was YES. [2024-11-19 09:48:54,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14656 conditions, 6777 events. 4227/6777 cut-off events. For 548/548 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 53537 event pairs, 4066 based on Foata normal form. 255/4822 useless extension candidates. Maximal degree in co-relation 9911. Up to 4655 conditions per place. [2024-11-19 09:48:54,053 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 64 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-19 09:48:54,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 403 flow [2024-11-19 09:48:54,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-11-19 09:48:54,054 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-11-19 09:48:54,054 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 199 flow. Second operand 4 states and 168 transitions. [2024-11-19 09:48:54,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 403 flow [2024-11-19 09:48:54,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 86 transitions, 393 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:48:54,057 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 208 flow [2024-11-19 09:48:54,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-11-19 09:48:54,058 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2024-11-19 09:48:54,058 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 208 flow [2024-11-19 09:48:54,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 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) [2024-11-19 09:48:54,059 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:54,059 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:54,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:48:54,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:54,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash -828811114, now seen corresponding path program 1 times [2024-11-19 09:48:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:54,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549901389] [2024-11-19 09:48:54,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:48:54,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:54,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549901389] [2024-11-19 09:48:54,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549901389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:54,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:54,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:54,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475068025] [2024-11-19 09:48:54,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:54,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:54,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:54,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:54,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:54,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:54,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:54,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:54,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:54,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:54,599 INFO L124 PetriNetUnfolderBase]: 2874/4728 cut-off events. [2024-11-19 09:48:54,599 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2024-11-19 09:48:54,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10815 conditions, 4728 events. 2874/4728 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 36358 event pairs, 2756 based on Foata normal form. 0/3432 useless extension candidates. Maximal degree in co-relation 6932. Up to 4074 conditions per place. [2024-11-19 09:48:54,632 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-11-19 09:48:54,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 288 flow [2024-11-19 09:48:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:48:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:48:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-19 09:48:54,633 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48125 [2024-11-19 09:48:54,633 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 208 flow. Second operand 5 states and 154 transitions. [2024-11-19 09:48:54,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 288 flow [2024-11-19 09:48:54,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:54,637 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 210 flow [2024-11-19 09:48:54,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-11-19 09:48:54,638 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-19 09:48:54,639 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 210 flow [2024-11-19 09:48:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:54,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:54,639 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:54,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:48:54,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:54,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:54,640 INFO L85 PathProgramCache]: Analyzing trace with hash -828811113, now seen corresponding path program 1 times [2024-11-19 09:48:54,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:54,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533117216] [2024-11-19 09:48:54,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:54,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:54,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:54,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533117216] [2024-11-19 09:48:54,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533117216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:54,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:54,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:48:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965269939] [2024-11-19 09:48:54,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:54,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:54,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:54,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:54,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:54,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:54,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,164 INFO L124 PetriNetUnfolderBase]: 1825/3123 cut-off events. [2024-11-19 09:48:55,165 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2024-11-19 09:48:55,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6912 conditions, 3123 events. 1825/3123 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 23122 event pairs, 1742 based on Foata normal form. 0/2534 useless extension candidates. Maximal degree in co-relation 3805. Up to 2669 conditions per place. [2024-11-19 09:48:55,186 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 38 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-11-19 09:48:55,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 286 flow [2024-11-19 09:48:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-19 09:48:55,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-19 09:48:55,187 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 210 flow. Second operand 4 states and 128 transitions. [2024-11-19 09:48:55,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 286 flow [2024-11-19 09:48:55,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 59 transitions, 275 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:48:55,190 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 199 flow [2024-11-19 09:48:55,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-11-19 09:48:55,191 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2024-11-19 09:48:55,191 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 199 flow [2024-11-19 09:48:55,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:55,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:55,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:48:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:48:55,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 746146854, now seen corresponding path program 1 times [2024-11-19 09:48:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012532563] [2024-11-19 09:48:55,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:55,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:55,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012532563] [2024-11-19 09:48:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012532563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:55,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:55,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:48:55,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900614768] [2024-11-19 09:48:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:55,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:55,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:55,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:55,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:55,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:48:55,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:55,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:55,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:48:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,632 INFO L124 PetriNetUnfolderBase]: 1199/2183 cut-off events. [2024-11-19 09:48:55,632 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2024-11-19 09:48:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 2183 events. 1199/2183 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15981 event pairs, 1132 based on Foata normal form. 0/1931 useless extension candidates. Maximal degree in co-relation 3217. Up to 1784 conditions per place. [2024-11-19 09:48:55,644 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 34 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-11-19 09:48:55,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 271 flow [2024-11-19 09:48:55,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-19 09:48:55,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-11-19 09:48:55,646 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 199 flow. Second operand 4 states and 134 transitions. [2024-11-19 09:48:55,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 271 flow [2024-11-19 09:48:55,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:55,649 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 198 flow [2024-11-19 09:48:55,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-11-19 09:48:55,654 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2024-11-19 09:48:55,655 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 198 flow [2024-11-19 09:48:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:55,655 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:55,655 INFO L204 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] [2024-11-19 09:48:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:48:55,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 126588631, now seen corresponding path program 1 times [2024-11-19 09:48:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256404652] [2024-11-19 09:48:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:55,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:55,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256404652] [2024-11-19 09:48:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256404652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:48:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981058292] [2024-11-19 09:48:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:55,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:55,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:55,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:55,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:55,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 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) [2024-11-19 09:48:55,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:55,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:55,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:56,150 INFO L124 PetriNetUnfolderBase]: 1773/3093 cut-off events. [2024-11-19 09:48:56,150 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2024-11-19 09:48:56,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6666 conditions, 3093 events. 1773/3093 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21376 event pairs, 249 based on Foata normal form. 208/3192 useless extension candidates. Maximal degree in co-relation 5454. Up to 1473 conditions per place. [2024-11-19 09:48:56,164 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 62 selfloop transitions, 6 changer transitions 1/84 dead transitions. [2024-11-19 09:48:56,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 84 transitions, 410 flow [2024-11-19 09:48:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:48:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:48:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-11-19 09:48:56,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55625 [2024-11-19 09:48:56,165 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 198 flow. Second operand 5 states and 178 transitions. [2024-11-19 09:48:56,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 84 transitions, 410 flow [2024-11-19 09:48:56,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:56,168 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 204 flow [2024-11-19 09:48:56,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-19 09:48:56,169 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-19 09:48:56,169 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 204 flow [2024-11-19 09:48:56,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 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) [2024-11-19 09:48:56,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:56,170 INFO L204 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] [2024-11-19 09:48:56,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:48:56,170 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:56,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2071444897, now seen corresponding path program 1 times [2024-11-19 09:48:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:56,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270037779] [2024-11-19 09:48:56,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:56,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:48:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:56,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270037779] [2024-11-19 09:48:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270037779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:56,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:48:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321921428] [2024-11-19 09:48:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:56,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:56,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:56,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:56,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:56,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:56,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:56,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:56,831 INFO L124 PetriNetUnfolderBase]: 2041/3212 cut-off events. [2024-11-19 09:48:56,831 INFO L125 PetriNetUnfolderBase]: For 2193/2639 co-relation queries the response was YES. [2024-11-19 09:48:56,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8161 conditions, 3212 events. 2041/3212 cut-off events. For 2193/2639 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 19778 event pairs, 249 based on Foata normal form. 572/3756 useless extension candidates. Maximal degree in co-relation 8122. Up to 1940 conditions per place. [2024-11-19 09:48:56,898 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 69 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2024-11-19 09:48:56,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 476 flow [2024-11-19 09:48:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:48:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:48:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-11-19 09:48:56,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5494791666666666 [2024-11-19 09:48:56,900 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 204 flow. Second operand 6 states and 211 transitions. [2024-11-19 09:48:56,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 476 flow [2024-11-19 09:48:56,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 463 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:48:56,903 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 257 flow [2024-11-19 09:48:56,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2024-11-19 09:48:56,905 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 4 predicate places. [2024-11-19 09:48:56,905 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 257 flow [2024-11-19 09:48:56,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:56,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:56,906 INFO L204 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] [2024-11-19 09:48:56,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:48:56,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:56,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1345613659, now seen corresponding path program 2 times [2024-11-19 09:48:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925990401] [2024-11-19 09:48:56,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:48:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:56,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:48:56,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:48:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:48:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:57,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925990401] [2024-11-19 09:48:57,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925990401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:57,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:57,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:48:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111836150] [2024-11-19 09:48:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:57,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:57,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:57,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:57,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2024-11-19 09:48:57,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:57,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:57,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2024-11-19 09:48:57,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:57,697 INFO L124 PetriNetUnfolderBase]: 3679/5956 cut-off events. [2024-11-19 09:48:57,698 INFO L125 PetriNetUnfolderBase]: For 6599/7045 co-relation queries the response was YES. [2024-11-19 09:48:57,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16539 conditions, 5956 events. 3679/5956 cut-off events. For 6599/7045 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 41482 event pairs, 905 based on Foata normal form. 536/6368 useless extension candidates. Maximal degree in co-relation 16497. Up to 2029 conditions per place. [2024-11-19 09:48:57,738 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 80 selfloop transitions, 14 changer transitions 0/109 dead transitions. [2024-11-19 09:48:57,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 109 transitions, 603 flow [2024-11-19 09:48:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:48:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:48:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2024-11-19 09:48:57,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.578125 [2024-11-19 09:48:57,740 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 257 flow. Second operand 6 states and 222 transitions. [2024-11-19 09:48:57,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 109 transitions, 603 flow [2024-11-19 09:48:57,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 109 transitions, 589 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:57,748 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 347 flow [2024-11-19 09:48:57,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2024-11-19 09:48:57,748 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2024-11-19 09:48:57,748 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 347 flow [2024-11-19 09:48:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:57,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:57,749 INFO L204 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] [2024-11-19 09:48:57,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:48:57,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:57,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:57,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1352211191, now seen corresponding path program 1 times [2024-11-19 09:48:57,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:57,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116095295] [2024-11-19 09:48:57,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:57,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:58,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116095295] [2024-11-19 09:48:58,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116095295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:58,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75376448] [2024-11-19 09:48:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:58,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:58,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:58,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:48:58,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:48:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 09:48:58,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:58,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2024-11-19 09:48:58,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 09:48:58,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-19 09:48:58,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-19 09:48:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:58,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:58,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-19 09:48:58,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-19 09:48:59,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-11-19 09:48:59,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-11-19 09:48:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75376448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:59,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-19 09:48:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765310530] [2024-11-19 09:48:59,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:59,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 09:48:59,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:59,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 09:48:59,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-19 09:48:59,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:48:59,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 347 flow. Second operand has 18 states, 18 states have (on average 29.555555555555557) internal successors, (532), 18 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:59,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:59,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:48:59,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:01,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 33#$Ultimate##0true, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true, Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,675 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-19 09:49:01,675 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:49:01,675 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:49:01,676 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-19 09:49:01,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 33#$Ultimate##0true, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true, Black: 153#(<= ~n1~0 0), 19#L56true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,676 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-19 09:49:01,676 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:49:01,676 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:49:01,676 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-19 09:49:01,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 33#$Ultimate##0true, 6#L144true, 97#(<= ~n2~0 2147483647), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,766 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,766 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,766 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:49:01,766 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:49:01,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 33#$Ultimate##0true, 6#L144true, 97#(<= ~n2~0 2147483647), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 19#L56true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,767 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-19 09:49:01,767 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-19 09:49:01,767 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:49:01,767 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:49:01,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 33#$Ultimate##0true, 97#(<= ~n2~0 2147483647), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 34#L144-1true, 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,843 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,843 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,843 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:49:01,843 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 13#L143-4true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,912 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:49:01,912 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,912 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:49:01,912 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:49:01,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true, Black: 153#(<= ~n1~0 0), 19#L56true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,912 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,913 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,913 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-19 09:49:01,913 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:49:01,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 42#thread1EXITtrue, Black: 162#(<= ~n2~0 0), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 13#L143-4true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true, 55#L74true]) [2024-11-19 09:49:01,970 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 13#L143-4true, 19#L56true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true, 55#L74true]) [2024-11-19 09:49:01,970 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,970 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:49:01,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 42#thread1EXITtrue, Black: 162#(<= ~n2~0 0), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 6#L144true, 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,972 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 09:49:01,972 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-19 09:49:01,972 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:49:01,972 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:49:01,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 6#L144true, 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 19#L56true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:01,972 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,972 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:49:01,973 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:49:01,973 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-19 09:49:02,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 42#thread1EXITtrue, Black: 162#(<= ~n2~0 0), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 6#L144true, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true, 55#L74true]) [2024-11-19 09:49:02,034 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 09:49:02,034 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:49:02,034 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:49:02,034 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:49:02,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 6#L144true, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 19#L56true, 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true, 55#L74true]) [2024-11-19 09:49:02,035 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 09:49:02,035 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:49:02,035 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-19 09:49:02,035 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:49:02,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 198#(<= ~q1_front~0 ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 34#L144-1true, 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:02,037 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 09:49:02,037 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:49:02,037 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:49:02,037 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-19 09:49:02,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 34#L144-1true, 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true, 55#L74true]) [2024-11-19 09:49:02,218 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-19 09:49:02,218 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:49:02,219 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-19 09:49:02,219 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:49:02,219 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][215], [Black: 189#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 162#(<= ~n2~0 0), 97#(<= ~n2~0 2147483647), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 198#(<= ~q1_front~0 ~q1_back~0), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 57#L145true, 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 153#(<= ~n1~0 0), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 23#L110true]) [2024-11-19 09:49:02,220 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-19 09:49:02,220 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:49:02,220 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-19 09:49:02,220 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-19 09:49:02,364 INFO L124 PetriNetUnfolderBase]: 9176/15578 cut-off events. [2024-11-19 09:49:02,364 INFO L125 PetriNetUnfolderBase]: For 45460/47057 co-relation queries the response was YES. [2024-11-19 09:49:02,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50371 conditions, 15578 events. 9176/15578 cut-off events. For 45460/47057 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 127085 event pairs, 430 based on Foata normal form. 1408/16531 useless extension candidates. Maximal degree in co-relation 24601. Up to 5054 conditions per place. [2024-11-19 09:49:02,481 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 210 selfloop transitions, 65 changer transitions 5/302 dead transitions. [2024-11-19 09:49:02,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 302 transitions, 1993 flow [2024-11-19 09:49:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 09:49:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-11-19 09:49:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 763 transitions. [2024-11-19 09:49:02,485 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.59609375 [2024-11-19 09:49:02,485 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 347 flow. Second operand 20 states and 763 transitions. [2024-11-19 09:49:02,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 302 transitions, 1993 flow [2024-11-19 09:49:02,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 302 transitions, 1930 flow, removed 27 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:02,544 INFO L231 Difference]: Finished difference. Result has 105 places, 128 transitions, 1071 flow [2024-11-19 09:49:02,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1071, PETRI_PLACES=105, PETRI_TRANSITIONS=128} [2024-11-19 09:49:02,545 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 39 predicate places. [2024-11-19 09:49:02,545 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 128 transitions, 1071 flow [2024-11-19 09:49:02,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.555555555555557) internal successors, (532), 18 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:02,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:02,546 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:02,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:49:02,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 09:49:02,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:02,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1659216756, now seen corresponding path program 1 times [2024-11-19 09:49:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:02,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270909033] [2024-11-19 09:49:02,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:02,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270909033] [2024-11-19 09:49:04,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270909033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:04,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59324626] [2024-11-19 09:49:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:04,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:04,053 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:49:04,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 09:49:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:04,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 09:49:04,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:04,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-19 09:49:04,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-19 09:49:04,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-19 09:49:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:49:04,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:04,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:49:04,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2024-11-19 09:49:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 09:49:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59324626] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:04,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:49:04,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 16 [2024-11-19 09:49:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847766743] [2024-11-19 09:49:04,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:04,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 09:49:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 09:49:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-19 09:49:04,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:49:04,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 128 transitions, 1071 flow. Second operand has 17 states, 17 states have (on average 29.823529411764707) internal successors, (507), 17 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:04,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:04,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:49:04,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:06,990 INFO L124 PetriNetUnfolderBase]: 8991/15133 cut-off events. [2024-11-19 09:49:06,990 INFO L125 PetriNetUnfolderBase]: For 68839/70443 co-relation queries the response was YES. [2024-11-19 09:49:07,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54189 conditions, 15133 events. 8991/15133 cut-off events. For 68839/70443 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 121825 event pairs, 650 based on Foata normal form. 1171/15816 useless extension candidates. Maximal degree in co-relation 48282. Up to 6204 conditions per place. [2024-11-19 09:49:07,121 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 126 selfloop transitions, 67 changer transitions 1/216 dead transitions. [2024-11-19 09:49:07,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 216 transitions, 1965 flow [2024-11-19 09:49:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 09:49:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-19 09:49:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 590 transitions. [2024-11-19 09:49:07,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5121527777777778 [2024-11-19 09:49:07,123 INFO L175 Difference]: Start difference. First operand has 105 places, 128 transitions, 1071 flow. Second operand 18 states and 590 transitions. [2024-11-19 09:49:07,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 216 transitions, 1965 flow [2024-11-19 09:49:07,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 216 transitions, 1933 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:07,363 INFO L231 Difference]: Finished difference. Result has 127 places, 151 transitions, 1511 flow [2024-11-19 09:49:07,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1511, PETRI_PLACES=127, PETRI_TRANSITIONS=151} [2024-11-19 09:49:07,364 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 61 predicate places. [2024-11-19 09:49:07,365 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 151 transitions, 1511 flow [2024-11-19 09:49:07,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 29.823529411764707) internal successors, (507), 17 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:07,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:07,365 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:07,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:07,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:07,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:07,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash -253337421, now seen corresponding path program 2 times [2024-11-19 09:49:07,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:07,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699961738] [2024-11-19 09:49:07,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:07,643 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:07,644 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:49:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699961738] [2024-11-19 09:49:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699961738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169123204] [2024-11-19 09:49:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:07,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:07,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:49:07,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 09:49:07,870 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:07,871 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:07,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:49:07,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:49:07,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:49:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169123204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:08,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:49:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-11-19 09:49:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125421244] [2024-11-19 09:49:08,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:49:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:49:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:49:08,094 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:49:08,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 151 transitions, 1511 flow. Second operand has 8 states, 8 states have (on average 32.75) internal successors, (262), 8 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:08,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:08,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:49:08,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:11,342 INFO L124 PetriNetUnfolderBase]: 15188/25834 cut-off events. [2024-11-19 09:49:11,342 INFO L125 PetriNetUnfolderBase]: For 138644/140867 co-relation queries the response was YES. [2024-11-19 09:49:11,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95424 conditions, 25834 events. 15188/25834 cut-off events. For 138644/140867 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 229483 event pairs, 2450 based on Foata normal form. 1856/26736 useless extension candidates. Maximal degree in co-relation 95336. Up to 11097 conditions per place. [2024-11-19 09:49:11,545 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 141 selfloop transitions, 53 changer transitions 0/216 dead transitions. [2024-11-19 09:49:11,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 216 transitions, 2391 flow [2024-11-19 09:49:11,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2024-11-19 09:49:11,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.671875 [2024-11-19 09:49:11,546 INFO L175 Difference]: Start difference. First operand has 127 places, 151 transitions, 1511 flow. Second operand 4 states and 172 transitions. [2024-11-19 09:49:11,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 216 transitions, 2391 flow [2024-11-19 09:49:11,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 216 transitions, 2306 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-11-19 09:49:11,882 INFO L231 Difference]: Finished difference. Result has 125 places, 170 transitions, 1945 flow [2024-11-19 09:49:11,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1945, PETRI_PLACES=125, PETRI_TRANSITIONS=170} [2024-11-19 09:49:11,883 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 59 predicate places. [2024-11-19 09:49:11,883 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 170 transitions, 1945 flow [2024-11-19 09:49:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.75) internal successors, (262), 8 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:11,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:11,884 INFO L204 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] [2024-11-19 09:49:11,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:12,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 09:49:12,085 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:12,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -549080032, now seen corresponding path program 1 times [2024-11-19 09:49:12,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:12,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401129779] [2024-11-19 09:49:12,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 09:49:12,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401129779] [2024-11-19 09:49:12,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401129779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:12,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:12,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:49:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666904975] [2024-11-19 09:49:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:49:12,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:49:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:49:12,207 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2024-11-19 09:49:12,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 170 transitions, 1945 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:12,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:12,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2024-11-19 09:49:12,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:16,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), 19#L56true, Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true, 55#L74true]) [2024-11-19 09:49:16,153 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-11-19 09:49:16,153 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-19 09:49:16,153 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-19 09:49:16,153 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-19 09:49:16,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), 19#L56true, Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 6#L144true, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 55#L74true]) [2024-11-19 09:49:16,335 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-19 09:49:16,335 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-19 09:49:16,335 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-19 09:49:16,335 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 09:49:16,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 481#true, 97#(<= ~n2~0 2147483647), Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true, 55#L74true]) [2024-11-19 09:49:16,481 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-19 09:49:16,481 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:49:16,481 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-19 09:49:16,481 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-19 09:49:16,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 209#true, 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), 19#L56true, Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 53#thread2EXITtrue, 481#true, 97#(<= ~n2~0 2147483647), Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true]) [2024-11-19 09:49:16,488 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-19 09:49:16,488 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 09:49:16,489 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-19 09:49:16,489 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-11-19 09:49:16,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 6#L144true, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 55#L74true]) [2024-11-19 09:49:16,707 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-19 09:49:16,707 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-19 09:49:16,707 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-19 09:49:16,707 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:49:16,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), 19#L56true, Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 6#L144true, 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))]) [2024-11-19 09:49:16,709 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-19 09:49:16,709 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-19 09:49:16,710 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 09:49:16,710 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-11-19 09:49:16,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 13#L143-4true]) [2024-11-19 09:49:16,755 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-11-19 09:49:16,755 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:49:16,755 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-19 09:49:16,755 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-19 09:49:16,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), 34#L144-1true, Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 55#L74true]) [2024-11-19 09:49:16,761 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-11-19 09:49:16,761 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-19 09:49:16,761 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 09:49:16,761 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-11-19 09:49:16,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [42#thread1EXITtrue, Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), 209#true, Black: 198#(<= ~q1_front~0 ~q1_back~0), 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 6#L144true, 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))]) [2024-11-19 09:49:16,799 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-11-19 09:49:16,799 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-11-19 09:49:16,799 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-19 09:49:16,799 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-11-19 09:49:16,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 53#thread2EXITtrue, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), 34#L144-1true, Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))]) [2024-11-19 09:49:16,824 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-11-19 09:49:16,824 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-11-19 09:49:16,824 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-19 09:49:16,824 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-11-19 09:49:16,834 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([917] L88-->L92: Formula: (let ((.cse1 (* v_~q1_front~0_150 4))) (let ((.cse0 (+ v_~q1~0.offset_111 .cse1))) (and (not (= 0 (ite (or (<= v_~total~0_142 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483648))) 1 0))) (<= 0 .cse0) (= (select |v_#valid_192| v_~q1~0.base_115) 1) (<= (+ v_~q1~0.offset_111 .cse1 4) (select |v_#length_181| v_~q1~0.base_115)) (<= 0 (+ v_~total~0_141 2147483648)) (<= v_~total~0_141 2147483647) (= (+ v_~q1_front~0_150 1) v_~q1_front~0_149) (not (= (ite (or (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork0_plus_#res#1_1| v_~total~0_142)) 1 0) 0)) (= v_~total~0_141 |v_thread3Thread1of1ForFork0_plus_#res#1_1|) (= |v_thread3Thread1of1ForFork0_plus_#res#1_1| (+ v_~total~0_142 (select (select |v_#memory_int#1_67| v_~q1~0.base_115) .cse0))) (not (= (ite (and (< v_~q1_front~0_150 v_~q1_back~0_138) (< v_~q1_front~0_150 v_~n1~0_58) (<= 0 v_~q1_front~0_150)) 1 0) 0))))) InVars {~q1~0.offset=v_~q1~0.offset_111, ~q1_front~0=v_~q1_front~0_150, ~q1_back~0=v_~q1_back~0_138, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, #length=|v_#length_181|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_142} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_1|, ~q1~0.offset=v_~q1~0.offset_111, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_149, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_1|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_67|, ~total~0=v_~total~0_141, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_138, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_1|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, #valid=|v_#valid_192|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_1|, #length=|v_#length_181|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][188], [Black: 190#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 192#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 199#(<= (+ ~q1_front~0 1) ~q1_back~0), 174#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 167#(= (select |#valid| ~q1~0.base) 1), Black: 198#(<= ~q1_front~0 ~q1_back~0), 209#true, 158#(= (select |#valid| ~q2~0.base) 1), Black: 202#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 435#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 0) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), Black: 466#(and (<= 1 ~total~0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 462#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (forall ((v_subst_3 Int)) (or (< ~n1~0 (+ v_subst_3 1)) (< v_subst_3 0) (< (+ ~q1~0.offset (* 4 v_subst_3)) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) 1) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* 4 v_subst_3))) ~total~0)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 470#(and (<= 1 ~total~0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (< ~q1_front~0 0) (< (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 153#(<= ~n1~0 0), Black: 431#(forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 0) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)) (< (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 1))), Black: 351#(or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0))), Black: 464#(and (forall ((v_subst_4 Int)) (or (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) ~total~0)) (< v_subst_4 0) (< (+ (* 4 v_subst_4) ~q1~0.offset) 0) (< (select (select |#memory_int#1| ~q1~0.base) (+ (* 4 v_subst_4) ~q1~0.offset)) 1) (< ~n1~0 (+ v_subst_4 1)))) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_back~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 204#(and (<= ~q1_front~0 ~q1_back~0) (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 216#(<= 1 ~total~0), 8#thread4EXITtrue, Black: 162#(<= ~n2~0 0), 1014#true, 97#(<= ~n2~0 2147483647), 481#true, Black: 749#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= 2 ~n1~0)) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|)))))), 57#L145true, Black: 491#(<= 1 ~total~0), 758#true, Black: 747#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (and (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1)))) (< ~q1_front~0 1))), 179#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), Black: 783#(= ~q1_back~0 ~q1_front~0), Black: 745#(and (or (< 0 ~q1_front~0) (< (+ ~q1~0.offset (* ~q1_front~0 4)) 1)) (= ~total~0 0) (or (< ~q1_back~0 1) (< ~n1~0 (+ ~q1_front~0 1)) (< ~q1_front~0 1) (= ~q1_back~0 ~q1_front~0) (< ~n1~0 (+ ~q1_back~0 1))) (or (< 0 ~q1_front~0) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 1)) (or (< ~q1_front~0 1) (and (or (< |ULTIMATE.start_create_fresh_int_array_~size#1| 3) (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2)) (or (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (and (= 2 ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< 0 |ULTIMATE.start_create_fresh_int_array_~i~1#1|))))), Black: 761#(<= ~q1_back~0 (+ ~q1_front~0 1)), 28#L92true, Black: 184#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))]) [2024-11-19 09:49:16,835 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-11-19 09:49:16,835 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-19 09:49:16,835 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-19 09:49:16,835 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-11-19 09:49:16,844 INFO L124 PetriNetUnfolderBase]: 18688/31034 cut-off events. [2024-11-19 09:49:16,844 INFO L125 PetriNetUnfolderBase]: For 219394/221941 co-relation queries the response was YES. [2024-11-19 09:49:17,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120927 conditions, 31034 events. 18688/31034 cut-off events. For 219394/221941 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 267936 event pairs, 6912 based on Foata normal form. 2434/32269 useless extension candidates. Maximal degree in co-relation 120838. Up to 12879 conditions per place. [2024-11-19 09:49:17,138 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 198 selfloop transitions, 11 changer transitions 0/231 dead transitions. [2024-11-19 09:49:17,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 231 transitions, 3174 flow [2024-11-19 09:49:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:49:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:49:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-11-19 09:49:17,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-19 09:49:17,140 INFO L175 Difference]: Start difference. First operand has 125 places, 170 transitions, 1945 flow. Second operand 3 states and 124 transitions. [2024-11-19 09:49:17,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 231 transitions, 3174 flow [2024-11-19 09:49:17,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 231 transitions, 3084 flow, removed 38 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:17,435 INFO L231 Difference]: Finished difference. Result has 127 places, 171 transitions, 1953 flow [2024-11-19 09:49:17,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1953, PETRI_PLACES=127, PETRI_TRANSITIONS=171} [2024-11-19 09:49:17,436 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 61 predicate places. [2024-11-19 09:49:17,436 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 171 transitions, 1953 flow [2024-11-19 09:49:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:17,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:17,436 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:49:17,437 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:17,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:17,437 INFO L85 PathProgramCache]: Analyzing trace with hash -291043906, now seen corresponding path program 1 times [2024-11-19 09:49:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163845753] [2024-11-19 09:49:17,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:17,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:49:18,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163845753] [2024-11-19 09:49:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163845753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010749299] [2024-11-19 09:49:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:18,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:49:18,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 09:49:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:18,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 09:49:18,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 09:49:18,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 09:49:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010749299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:18,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:49:18,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 27 [2024-11-19 09:49:18,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810203328] [2024-11-19 09:49:18,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:18,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-19 09:49:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-19 09:49:18,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-11-19 09:49:19,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 64 [2024-11-19 09:49:19,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 171 transitions, 1953 flow. Second operand has 28 states, 28 states have (on average 17.214285714285715) internal successors, (482), 28 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:19,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:19,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 64 [2024-11-19 09:49:19,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand