./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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-queue-add-3.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 d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:15:47,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:15:47,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:15:47,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:15:47,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:15:47,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:15:47,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:15:47,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:15:47,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:15:47,874 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:15:47,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:15:47,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:15:47,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:15:47,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:15:47,875 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:15:47,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:15:47,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:47,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:15:47,877 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> d2c89f010e0f73e8ba7e81bb150b82b70d39c0827c0d616dd2c3347839d51e01 [2025-03-04 10:15:48,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:15:48,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:15:48,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:15:48,104 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:15:48,105 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:15:48,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-03-04 10:15:49,200 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad52333d5/2a963d13d12540d9ad367d220772f7b7/FLAG20699997d [2025-03-04 10:15:49,441 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:15:49,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-3.wvr.c [2025-03-04 10:15:49,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad52333d5/2a963d13d12540d9ad367d220772f7b7/FLAG20699997d [2025-03-04 10:15:49,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad52333d5/2a963d13d12540d9ad367d220772f7b7 [2025-03-04 10:15:49,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:15:49,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:15:49,778 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:49,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:15:49,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:15:49,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,784 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ccf410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49, skipping insertion in model container [2025-03-04 10:15:49,784 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:15:49,890 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:15:49,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:49,897 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:15:49,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:49,934 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:15:49,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49 WrapperNode [2025-03-04 10:15:49,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:49,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:49,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:15:49,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:15:49,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,966 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 226 [2025-03-04 10:15:49,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:49,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:15:49,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:15:49,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:15:49,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,997 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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]. [2025-03-04 10:15:49,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:49,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:50,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:50,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:50,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:50,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:50,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:15:50,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:15:50,007 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:15:50,007 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:15:50,008 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (1/1) ... [2025-03-04 10:15:50,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:50,031 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) [2025-03-04 10:15:50,033 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 [2025-03-04 10:15:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:15:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:15:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:15:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:15:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:15:50,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:15:50,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:15:50,050 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:15:50,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:15:50,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:15:50,473 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:15:50,474 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:15:50,681 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:15:50,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:15:50,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:50 BoogieIcfgContainer [2025-03-04 10:15:50,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:15:50,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:15:50,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:15:50,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:15:50,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:15:49" (1/3) ... [2025-03-04 10:15:50,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e693b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:50, skipping insertion in model container [2025-03-04 10:15:50,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:49" (2/3) ... [2025-03-04 10:15:50,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e693b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:50, skipping insertion in model container [2025-03-04 10:15:50,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:50" (3/3) ... [2025-03-04 10:15:50,691 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-03-04 10:15:50,702 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:15:50,703 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 54 locations, 1 initial locations, 5 loop locations, and 16 error locations. [2025-03-04 10:15:50,704 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:15:50,752 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:15:50,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 141 flow [2025-03-04 10:15:50,805 INFO L124 PetriNetUnfolderBase]: 7/57 cut-off events. [2025-03-04 10:15:50,807 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:15:50,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 7/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 132 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-04 10:15:50,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 60 transitions, 141 flow [2025-03-04 10:15:50,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 56 transitions, 130 flow [2025-03-04 10:15:50,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:15:50,831 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;@134cc095, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:15:50,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-04 10:15:50,835 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:15:50,836 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:15:50,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:15:50,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:50,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:15:50,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:50,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 647922, now seen corresponding path program 1 times [2025-03-04 10:15:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079913193] [2025-03-04 10:15:50,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:50,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:15:50,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:15:50,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:50,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:51,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:51,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079913193] [2025-03-04 10:15:51,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079913193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:51,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:51,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:15:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252711300] [2025-03-04 10:15:51,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:51,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:15:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:51,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:15:51,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:15:51,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:51,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:51,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:51,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:51,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:51,583 INFO L124 PetriNetUnfolderBase]: 3071/4842 cut-off events. [2025-03-04 10:15:51,584 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-03-04 10:15:51,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9318 conditions, 4842 events. 3071/4842 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28683 event pairs, 2731 based on Foata normal form. 1/3084 useless extension candidates. Maximal degree in co-relation 8911. Up to 4203 conditions per place. [2025-03-04 10:15:51,623 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 38 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-03-04 10:15:51,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 198 flow [2025-03-04 10:15:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:15:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:15:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 10:15:51,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 10:15:51,637 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 130 flow. Second operand 3 states and 87 transitions. [2025-03-04 10:15:51,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 198 flow [2025-03-04 10:15:51,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 186 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:15:51,651 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 110 flow [2025-03-04 10:15:51,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2025-03-04 10:15:51,656 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2025-03-04 10:15:51,657 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 110 flow [2025-03-04 10:15:51,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:51,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:51,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:15:51,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:15:51,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:51,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:51,658 INFO L85 PathProgramCache]: Analyzing trace with hash 647923, now seen corresponding path program 1 times [2025-03-04 10:15:51,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:51,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192686528] [2025-03-04 10:15:51,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:51,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:15:51,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:15:51,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:51,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:51,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:51,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192686528] [2025-03-04 10:15:51,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192686528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:51,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:51,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:51,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138665855] [2025-03-04 10:15:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:51,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:51,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:51,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:51,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:51,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:51,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:51,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:51,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:51,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:52,423 INFO L124 PetriNetUnfolderBase]: 3072/4845 cut-off events. [2025-03-04 10:15:52,424 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 10:15:52,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9164 conditions, 4845 events. 3072/4845 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28671 event pairs, 2731 based on Foata normal form. 0/3084 useless extension candidates. Maximal degree in co-relation 9135. Up to 4212 conditions per place. [2025-03-04 10:15:52,446 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 41 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-04 10:15:52,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 206 flow [2025-03-04 10:15:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:52,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-04 10:15:52,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-04 10:15:52,448 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 110 flow. Second operand 4 states and 102 transitions. [2025-03-04 10:15:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 206 flow [2025-03-04 10:15:52,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:52,450 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 133 flow [2025-03-04 10:15:52,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-04 10:15:52,451 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2025-03-04 10:15:52,451 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 133 flow [2025-03-04 10:15:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:52,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:52,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:15:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:15:52,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:52,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 20087568, now seen corresponding path program 1 times [2025-03-04 10:15:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781618189] [2025-03-04 10:15:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:52,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:15:52,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:15:52,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:52,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781618189] [2025-03-04 10:15:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781618189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:52,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:52,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:52,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505313206] [2025-03-04 10:15:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:52,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:52,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:52,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:52,710 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:52,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:52,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:52,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:52,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:53,073 INFO L124 PetriNetUnfolderBase]: 3073/4848 cut-off events. [2025-03-04 10:15:53,073 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-04 10:15:53,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9181 conditions, 4848 events. 3073/4848 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28666 event pairs, 2731 based on Foata normal form. 0/3086 useless extension candidates. Maximal degree in co-relation 9156. Up to 4211 conditions per place. [2025-03-04 10:15:53,098 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2025-03-04 10:15:53,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 235 flow [2025-03-04 10:15:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:53,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-04 10:15:53,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2025-03-04 10:15:53,101 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 133 flow. Second operand 5 states and 119 transitions. [2025-03-04 10:15:53,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 235 flow [2025-03-04 10:15:53,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:53,102 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 167 flow [2025-03-04 10:15:53,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2025-03-04 10:15:53,104 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-04 10:15:53,104 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 167 flow [2025-03-04 10:15:53,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:53,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:53,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:15:53,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:15:53,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:53,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash 622674393, now seen corresponding path program 1 times [2025-03-04 10:15:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:53,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167160007] [2025-03-04 10:15:53,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:53,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:53,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:15:53,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:15:53,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:53,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167160007] [2025-03-04 10:15:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167160007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391272996] [2025-03-04 10:15:53,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:53,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:53,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:53,293 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) [2025-03-04 10:15:53,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:15:53,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:15:53,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:15:53,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:53,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:53,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:15:53,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:53,415 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 8 treesize of output 1 [2025-03-04 10:15:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:53,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391272996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:53,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:53,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:15:53,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869188881] [2025-03-04 10:15:53,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:53,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:15:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:53,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:15:53,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:53,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:53,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 167 flow. Second operand has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:53,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:53,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:53,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:54,011 INFO L124 PetriNetUnfolderBase]: 3073/4847 cut-off events. [2025-03-04 10:15:54,011 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 10:15:54,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 4847 events. 3073/4847 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28729 event pairs, 2731 based on Foata normal form. 0/3088 useless extension candidates. Maximal degree in co-relation 9166. Up to 4211 conditions per place. [2025-03-04 10:15:54,035 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-04 10:15:54,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 257 flow [2025-03-04 10:15:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-03-04 10:15:54,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2025-03-04 10:15:54,038 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 167 flow. Second operand 6 states and 129 transitions. [2025-03-04 10:15:54,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 257 flow [2025-03-04 10:15:54,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:15:54,040 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 176 flow [2025-03-04 10:15:54,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-03-04 10:15:54,040 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2025-03-04 10:15:54,041 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 176 flow [2025-03-04 10:15:54,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.363636363636363) internal successors, (169), 11 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:54,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:54,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:15:54,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:54,246 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 [2025-03-04 10:15:54,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:54,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2124303630, now seen corresponding path program 1 times [2025-03-04 10:15:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:54,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7359598] [2025-03-04 10:15:54,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:54,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:15:54,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:15:54,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:54,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:54,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7359598] [2025-03-04 10:15:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7359598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935267641] [2025-03-04 10:15:54,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:54,438 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) [2025-03-04 10:15:54,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:15:54,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:15:54,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:15:54,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:54,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:54,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:15:54,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:54,508 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 [2025-03-04 10:15:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:54,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:54,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935267641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:54,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:54,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:15:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851076095] [2025-03-04 10:15:54,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:54,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:15:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:54,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:15:54,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:15:54,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:54,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:54,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:54,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:54,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:55,460 INFO L124 PetriNetUnfolderBase]: 3073/4846 cut-off events. [2025-03-04 10:15:55,460 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 10:15:55,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9198 conditions, 4846 events. 3073/4846 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 28667 event pairs, 2731 based on Foata normal form. 0/3088 useless extension candidates. Maximal degree in co-relation 9165. Up to 4203 conditions per place. [2025-03-04 10:15:55,484 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 34 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2025-03-04 10:15:55,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 264 flow [2025-03-04 10:15:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:15:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:15:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2025-03-04 10:15:55,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2025-03-04 10:15:55,485 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 176 flow. Second operand 7 states and 145 transitions. [2025-03-04 10:15:55,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 264 flow [2025-03-04 10:15:55,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 230 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-04 10:15:55,488 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 162 flow [2025-03-04 10:15:55,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=162, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-04 10:15:55,490 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2025-03-04 10:15:55,490 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 162 flow [2025-03-04 10:15:55,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:55,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:55,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:55,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:15:55,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:55,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:55,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1432130176, now seen corresponding path program 1 times [2025-03-04 10:15:55,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:55,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101997539] [2025-03-04 10:15:55,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:55,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:55,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:15:55,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:15:55,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:55,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101997539] [2025-03-04 10:15:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101997539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290358623] [2025-03-04 10:15:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:55,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:55,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:55,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:55,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:55,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:55,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:55,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:55,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:56,142 INFO L124 PetriNetUnfolderBase]: 3213/5106 cut-off events. [2025-03-04 10:15:56,143 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 10:15:56,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9696 conditions, 5106 events. 3213/5106 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 30367 event pairs, 2858 based on Foata normal form. 101/3413 useless extension candidates. Maximal degree in co-relation 9149. Up to 4212 conditions per place. [2025-03-04 10:15:56,157 INFO L140 encePairwiseOnDemand]: 46/60 looper letters, 60 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-03-04 10:15:56,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 363 flow [2025-03-04 10:15:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-04 10:15:56,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2025-03-04 10:15:56,159 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 162 flow. Second operand 5 states and 152 transitions. [2025-03-04 10:15:56,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 363 flow [2025-03-04 10:15:56,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 324 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 10:15:56,161 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 182 flow [2025-03-04 10:15:56,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-03-04 10:15:56,162 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2025-03-04 10:15:56,162 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 182 flow [2025-03-04 10:15:56,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:56,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:56,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:56,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:15:56,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:56,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash -231076250, now seen corresponding path program 1 times [2025-03-04 10:15:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:56,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59696922] [2025-03-04 10:15:56,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:56,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:15:56,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:15:56,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:56,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:56,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59696922] [2025-03-04 10:15:56,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59696922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:56,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242301226] [2025-03-04 10:15:56,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:56,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:56,315 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) [2025-03-04 10:15:56,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:15:56,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:15:56,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:15:56,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:56,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:56,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:15:56,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:56,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:15:56,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:15:56,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-04 10:15:56,448 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:15:56,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-03-04 10:15:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:56,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:15:56,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242301226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:56,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:15:56,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-04 10:15:56,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787181842] [2025-03-04 10:15:56,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:56,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:56,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:56,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:15:56,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:56,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:56,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:56,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:56,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:56,732 INFO L124 PetriNetUnfolderBase]: 2360/3811 cut-off events. [2025-03-04 10:15:56,732 INFO L125 PetriNetUnfolderBase]: For 355/355 co-relation queries the response was YES. [2025-03-04 10:15:56,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7862 conditions, 3811 events. 2360/3811 cut-off events. For 355/355 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 21571 event pairs, 2053 based on Foata normal form. 0/2678 useless extension candidates. Maximal degree in co-relation 7340. Up to 3239 conditions per place. [2025-03-04 10:15:56,747 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 42 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-03-04 10:15:56,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 260 flow [2025-03-04 10:15:56,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:56,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 10:15:56,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 10:15:56,749 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 182 flow. Second operand 4 states and 96 transitions. [2025-03-04 10:15:56,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 260 flow [2025-03-04 10:15:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:56,752 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 171 flow [2025-03-04 10:15:56,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-04 10:15:56,752 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2025-03-04 10:15:56,753 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 171 flow [2025-03-04 10:15:56,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:56,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:56,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:56,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:56,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:56,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash -231076251, now seen corresponding path program 1 times [2025-03-04 10:15:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576527238] [2025-03-04 10:15:56,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:56,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:15:56,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:15:56,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:56,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576527238] [2025-03-04 10:15:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576527238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691457540] [2025-03-04 10:15:57,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:57,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:57,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:57,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:57,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:57,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:57,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:57,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:57,166 INFO L124 PetriNetUnfolderBase]: 1613/2634 cut-off events. [2025-03-04 10:15:57,166 INFO L125 PetriNetUnfolderBase]: For 309/309 co-relation queries the response was YES. [2025-03-04 10:15:57,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 2634 events. 1613/2634 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13727 event pairs, 1376 based on Foata normal form. 0/2063 useless extension candidates. Maximal degree in co-relation 4719. Up to 2220 conditions per place. [2025-03-04 10:15:57,176 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2025-03-04 10:15:57,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 243 flow [2025-03-04 10:15:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:15:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:15:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 10:15:57,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2025-03-04 10:15:57,177 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 171 flow. Second operand 5 states and 107 transitions. [2025-03-04 10:15:57,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 243 flow [2025-03-04 10:15:57,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 50 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:57,178 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 167 flow [2025-03-04 10:15:57,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-04 10:15:57,179 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-04 10:15:57,179 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 167 flow [2025-03-04 10:15:57,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:57,179 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:57,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:15:57,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1843473174, now seen corresponding path program 1 times [2025-03-04 10:15:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292291923] [2025-03-04 10:15:57,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:57,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:15:57,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:15:57,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:57,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:57,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292291923] [2025-03-04 10:15:57,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292291923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:57,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:57,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:15:57,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486677276] [2025-03-04 10:15:57,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:57,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:15:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:57,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:15:57,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:15:57,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:57,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:57,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:57,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:57,346 INFO L124 PetriNetUnfolderBase]: 1499/2410 cut-off events. [2025-03-04 10:15:57,346 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-03-04 10:15:57,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5034 conditions, 2410 events. 1499/2410 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12007 event pairs, 577 based on Foata normal form. 77/1916 useless extension candidates. Maximal degree in co-relation 4790. Up to 1517 conditions per place. [2025-03-04 10:15:57,355 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 52 selfloop transitions, 2 changer transitions 3/65 dead transitions. [2025-03-04 10:15:57,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 319 flow [2025-03-04 10:15:57,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:15:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:15:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-04 10:15:57,356 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-04 10:15:57,357 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 167 flow. Second operand 3 states and 100 transitions. [2025-03-04 10:15:57,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 319 flow [2025-03-04 10:15:57,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:57,359 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 152 flow [2025-03-04 10:15:57,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2025-03-04 10:15:57,360 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-04 10:15:57,361 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 152 flow [2025-03-04 10:15:57,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:57,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:57,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:15:57,361 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:57,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1266692230, now seen corresponding path program 1 times [2025-03-04 10:15:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111793226] [2025-03-04 10:15:57,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:57,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:15:57,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:15:57,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:57,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:57,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111793226] [2025-03-04 10:15:57,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111793226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:57,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:57,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:15:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225916614] [2025-03-04 10:15:57,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:57,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:15:57,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:57,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:15:57,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:15:57,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:57,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:57,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:57,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:57,514 INFO L124 PetriNetUnfolderBase]: 1318/2143 cut-off events. [2025-03-04 10:15:57,514 INFO L125 PetriNetUnfolderBase]: For 404/404 co-relation queries the response was YES. [2025-03-04 10:15:57,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 2143 events. 1318/2143 cut-off events. For 404/404 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10351 event pairs, 527 based on Foata normal form. 18/1788 useless extension candidates. Maximal degree in co-relation 4726. Up to 1772 conditions per place. [2025-03-04 10:15:57,522 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 47 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-04 10:15:57,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 278 flow [2025-03-04 10:15:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:15:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:15:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 10:15:57,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-04 10:15:57,523 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 152 flow. Second operand 3 states and 93 transitions. [2025-03-04 10:15:57,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 278 flow [2025-03-04 10:15:57,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 272 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:57,524 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 169 flow [2025-03-04 10:15:57,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-04 10:15:57,525 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2025-03-04 10:15:57,525 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 169 flow [2025-03-04 10:15:57,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:57,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:57,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:15:57,525 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:57,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:57,526 INFO L85 PathProgramCache]: Analyzing trace with hash 956840605, now seen corresponding path program 1 times [2025-03-04 10:15:57,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:57,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091548780] [2025-03-04 10:15:57,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:57,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:57,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:15:57,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:15:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:15:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091548780] [2025-03-04 10:15:57,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091548780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:57,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:57,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:57,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862603369] [2025-03-04 10:15:57,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:57,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:57,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:57,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:57,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:57,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:57,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:57,704 INFO L124 PetriNetUnfolderBase]: 964/1606 cut-off events. [2025-03-04 10:15:57,705 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2025-03-04 10:15:57,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 1606 events. 964/1606 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7433 event pairs, 704 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 3794. Up to 1366 conditions per place. [2025-03-04 10:15:57,711 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 37 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-04 10:15:57,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 243 flow [2025-03-04 10:15:57,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-04 10:15:57,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-04 10:15:57,712 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 169 flow. Second operand 4 states and 90 transitions. [2025-03-04 10:15:57,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 243 flow [2025-03-04 10:15:57,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 230 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:57,713 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 156 flow [2025-03-04 10:15:57,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2025-03-04 10:15:57,714 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-04 10:15:57,714 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 156 flow [2025-03-04 10:15:57,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:57,714 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:15:57,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:57,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash 422815254, now seen corresponding path program 1 times [2025-03-04 10:15:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441046997] [2025-03-04 10:15:57,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:57,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:15:57,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:15:57,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:57,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:15:57,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:57,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441046997] [2025-03-04 10:15:57,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441046997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:57,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:57,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:57,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849822774] [2025-03-04 10:15:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:57,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:57,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:57,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:57,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:57,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:57,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:57,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:57,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:57,933 INFO L124 PetriNetUnfolderBase]: 1205/2003 cut-off events. [2025-03-04 10:15:57,933 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2025-03-04 10:15:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 2003 events. 1205/2003 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9334 event pairs, 906 based on Foata normal form. 64/1901 useless extension candidates. Maximal degree in co-relation 4412. Up to 1374 conditions per place. [2025-03-04 10:15:57,940 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 37 selfloop transitions, 2 changer transitions 19/66 dead transitions. [2025-03-04 10:15:57,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 322 flow [2025-03-04 10:15:57,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 10:15:57,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-03-04 10:15:57,941 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 156 flow. Second operand 4 states and 117 transitions. [2025-03-04 10:15:57,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 322 flow [2025-03-04 10:15:57,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:57,943 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 154 flow [2025-03-04 10:15:57,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-03-04 10:15:57,945 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2025-03-04 10:15:57,945 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 154 flow [2025-03-04 10:15:57,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:57,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:57,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:57,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:15:57,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:57,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1506081900, now seen corresponding path program 1 times [2025-03-04 10:15:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962274658] [2025-03-04 10:15:57,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:57,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:15:57,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:15:57,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:57,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:15:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:58,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962274658] [2025-03-04 10:15:58,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962274658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:58,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:58,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:15:58,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463081094] [2025-03-04 10:15:58,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:58,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:15:58,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:58,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:15:58,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:15:58,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:58,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:58,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:58,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:58,211 INFO L124 PetriNetUnfolderBase]: 663/1152 cut-off events. [2025-03-04 10:15:58,212 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-03-04 10:15:58,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 1152 events. 663/1152 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5188 event pairs, 474 based on Foata normal form. 86/1148 useless extension candidates. Maximal degree in co-relation 2514. Up to 945 conditions per place. [2025-03-04 10:15:58,216 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 35 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-03-04 10:15:58,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 220 flow [2025-03-04 10:15:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:58,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 10:15:58,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-04 10:15:58,217 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 154 flow. Second operand 4 states and 96 transitions. [2025-03-04 10:15:58,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 220 flow [2025-03-04 10:15:58,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 216 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:58,218 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 146 flow [2025-03-04 10:15:58,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2025-03-04 10:15:58,219 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2025-03-04 10:15:58,219 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 146 flow [2025-03-04 10:15:58,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:58,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:58,219 INFO L206 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] [2025-03-04 10:15:58,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:15:58,219 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:58,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash -873602252, now seen corresponding path program 1 times [2025-03-04 10:15:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302518984] [2025-03-04 10:15:58,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:58,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:15:58,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:15:58,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:58,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302518984] [2025-03-04 10:15:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302518984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:15:58,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927214273] [2025-03-04 10:15:58,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:58,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:15:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:58,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:15:58,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:15:58,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:15:58,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 146 flow. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:58,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:58,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:15:58,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:58,580 INFO L124 PetriNetUnfolderBase]: 1274/2030 cut-off events. [2025-03-04 10:15:58,580 INFO L125 PetriNetUnfolderBase]: For 523/523 co-relation queries the response was YES. [2025-03-04 10:15:58,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 2030 events. 1274/2030 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10578 event pairs, 307 based on Foata normal form. 1/1992 useless extension candidates. Maximal degree in co-relation 4624. Up to 775 conditions per place. [2025-03-04 10:15:58,587 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 82 selfloop transitions, 9 changer transitions 10/107 dead transitions. [2025-03-04 10:15:58,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 521 flow [2025-03-04 10:15:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:15:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:15:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2025-03-04 10:15:58,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43125 [2025-03-04 10:15:58,589 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 146 flow. Second operand 8 states and 207 transitions. [2025-03-04 10:15:58,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 521 flow [2025-03-04 10:15:58,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:58,591 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 193 flow [2025-03-04 10:15:58,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=193, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2025-03-04 10:15:58,592 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-03-04 10:15:58,592 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 193 flow [2025-03-04 10:15:58,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:58,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:58,593 INFO L206 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] [2025-03-04 10:15:58,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:15:58,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:58,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1117180568, now seen corresponding path program 1 times [2025-03-04 10:15:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550716120] [2025-03-04 10:15:58,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:58,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:15:58,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:15:58,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:58,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550716120] [2025-03-04 10:15:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550716120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884865390] [2025-03-04 10:15:58,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:58,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:58,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:58,720 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) [2025-03-04 10:15:58,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:15:58,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:15:58,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:15:58,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:58,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:58,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:15:58,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:58,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:15:58,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884865390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:58,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:58,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-04 10:15:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112874193] [2025-03-04 10:15:58,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:58,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:15:58,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:58,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:15:58,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:15:58,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:58,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 193 flow. Second operand has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:58,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:58,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:58,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:59,352 INFO L124 PetriNetUnfolderBase]: 1661/3049 cut-off events. [2025-03-04 10:15:59,352 INFO L125 PetriNetUnfolderBase]: For 1370/1370 co-relation queries the response was YES. [2025-03-04 10:15:59,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7419 conditions, 3049 events. 1661/3049 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18620 event pairs, 909 based on Foata normal form. 112/3010 useless extension candidates. Maximal degree in co-relation 7403. Up to 1488 conditions per place. [2025-03-04 10:15:59,362 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 70 selfloop transitions, 15 changer transitions 6/102 dead transitions. [2025-03-04 10:15:59,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 102 transitions, 552 flow [2025-03-04 10:15:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:15:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:15:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions. [2025-03-04 10:15:59,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4203703703703704 [2025-03-04 10:15:59,364 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 193 flow. Second operand 9 states and 227 transitions. [2025-03-04 10:15:59,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 102 transitions, 552 flow [2025-03-04 10:15:59,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 545 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:59,366 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 296 flow [2025-03-04 10:15:59,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2025-03-04 10:15:59,367 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 14 predicate places. [2025-03-04 10:15:59,367 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 296 flow [2025-03-04 10:15:59,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.714285714285715) internal successors, (290), 14 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:59,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:59,368 INFO L206 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] [2025-03-04 10:15:59,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:59,569 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,SelfDestructingSolverStorable14 [2025-03-04 10:15:59,569 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:59,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1106820846, now seen corresponding path program 1 times [2025-03-04 10:15:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183236205] [2025-03-04 10:15:59,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:59,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:15:59,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:15:59,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:59,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:15:59,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:59,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183236205] [2025-03-04 10:15:59,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183236205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:59,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:59,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:59,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964750099] [2025-03-04 10:15:59,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:59,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:59,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:59,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:59,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:59,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:15:59,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:59,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:59,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:15:59,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:59,960 INFO L124 PetriNetUnfolderBase]: 2547/4806 cut-off events. [2025-03-04 10:15:59,960 INFO L125 PetriNetUnfolderBase]: For 4077/4235 co-relation queries the response was YES. [2025-03-04 10:15:59,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12257 conditions, 4806 events. 2547/4806 cut-off events. For 4077/4235 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 32146 event pairs, 732 based on Foata normal form. 132/4685 useless extension candidates. Maximal degree in co-relation 9510. Up to 1370 conditions per place. [2025-03-04 10:15:59,984 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 81 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2025-03-04 10:15:59,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 613 flow [2025-03-04 10:15:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-03-04 10:15:59,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 10:15:59,986 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 296 flow. Second operand 4 states and 130 transitions. [2025-03-04 10:15:59,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 613 flow [2025-03-04 10:15:59,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 596 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:59,992 INFO L231 Difference]: Finished difference. Result has 76 places, 64 transitions, 340 flow [2025-03-04 10:15:59,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=76, PETRI_TRANSITIONS=64} [2025-03-04 10:15:59,993 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2025-03-04 10:15:59,993 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 64 transitions, 340 flow [2025-03-04 10:15:59,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:59,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:59,993 INFO L206 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] [2025-03-04 10:15:59,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:15:59,994 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:15:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:59,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1654381450, now seen corresponding path program 2 times [2025-03-04 10:15:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171785913] [2025-03-04 10:15:59,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:00,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:16:00,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:16:00,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:00,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:00,459 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:16:00,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171785913] [2025-03-04 10:16:00,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171785913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:00,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551977789] [2025-03-04 10:16:00,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:00,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:00,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:00,461 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) [2025-03-04 10:16:00,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:16:00,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:16:00,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:16:00,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:00,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:16:00,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:00,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:01,067 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-04 10:16:01,068 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 25 treesize of output 12 [2025-03-04 10:16:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:01,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551977789] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:01,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-04 10:16:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697954305] [2025-03-04 10:16:01,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:01,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:16:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:01,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:16:01,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:16:01,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:16:01,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 64 transitions, 340 flow. Second operand has 30 states, 30 states have (on average 16.866666666666667) internal successors, (506), 30 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:01,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:01,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:16:01,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:04,781 INFO L124 PetriNetUnfolderBase]: 13528/22273 cut-off events. [2025-03-04 10:16:04,781 INFO L125 PetriNetUnfolderBase]: For 29647/30625 co-relation queries the response was YES. [2025-03-04 10:16:04,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64408 conditions, 22273 events. 13528/22273 cut-off events. For 29647/30625 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 164529 event pairs, 2152 based on Foata normal form. 135/21573 useless extension candidates. Maximal degree in co-relation 53049. Up to 4915 conditions per place. [2025-03-04 10:16:04,881 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 346 selfloop transitions, 91 changer transitions 0/446 dead transitions. [2025-03-04 10:16:04,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 446 transitions, 2941 flow [2025-03-04 10:16:04,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 10:16:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-04 10:16:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 961 transitions. [2025-03-04 10:16:04,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.390650406504065 [2025-03-04 10:16:04,886 INFO L175 Difference]: Start difference. First operand has 76 places, 64 transitions, 340 flow. Second operand 41 states and 961 transitions. [2025-03-04 10:16:04,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 446 transitions, 2941 flow [2025-03-04 10:16:04,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 446 transitions, 2895 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-04 10:16:04,906 INFO L231 Difference]: Finished difference. Result has 135 places, 143 transitions, 1195 flow [2025-03-04 10:16:04,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1195, PETRI_PLACES=135, PETRI_TRANSITIONS=143} [2025-03-04 10:16:04,907 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 76 predicate places. [2025-03-04 10:16:04,907 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 143 transitions, 1195 flow [2025-03-04 10:16:04,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 16.866666666666667) internal successors, (506), 30 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:04,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:04,907 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-04 10:16:04,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:16:05,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:16:05,108 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:16:05,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:05,108 INFO L85 PathProgramCache]: Analyzing trace with hash -528995712, now seen corresponding path program 3 times [2025-03-04 10:16:05,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:05,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910452977] [2025-03-04 10:16:05,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:05,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:05,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 4 equivalence classes. [2025-03-04 10:16:05,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 40 statements. [2025-03-04 10:16:05,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:16:05,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:16:05,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:05,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910452977] [2025-03-04 10:16:05,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910452977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:05,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:16:05,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:16:05,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184316618] [2025-03-04 10:16:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:05,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:16:05,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:05,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:16:05,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:16:05,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2025-03-04 10:16:05,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 143 transitions, 1195 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:05,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:05,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2025-03-04 10:16:05,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:06,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L99-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][175], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 500#(<= ~q2_back~0 ~q2_front~0), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:06,883 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L87-->L93: Formula: (let ((.cse1 (* 4 v_~q2_front~0_68))) (let ((.cse0 (+ v_~q2~0.offset_47 .cse1))) (and (= (+ v_~q2_front~0_68 1) v_~q2_front~0_67) (= (select |v_#valid_154| v_~q2~0.base_51) 1) (<= 0 .cse0) (not (= (ite (and (< v_~q2_front~0_68 v_~n2~0_78) (< v_~q2_front~0_68 v_~q2_back~0_75) (<= 0 v_~q2_front~0_68)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~k~0#1_3| (select (select |v_#memory_int#1_44| v_~q2~0.base_51) .cse0)) (<= (+ v_~q2~0.offset_47 .cse1 4) (select |v_#length_121| v_~q2~0.base_51))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, #valid=|v_#valid_154|, ~q2_front~0=v_~q2_front~0_68, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, #memory_int#1=|v_#memory_int#1_44|, ~q2_back~0=v_~q2_back~0_75} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~q2_front~0=v_~q2_front~0_67, #memory_int#1=|v_#memory_int#1_44|, thread3Thread1of1ForFork2_#t~post11#1=|v_thread3Thread1of1ForFork2_#t~post11#1_1|, #valid=|v_#valid_154|, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, ~q2_back~0=v_~q2_back~0_75, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork2_~k~0#1][124], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 50#L93true, 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:06,884 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:06,884 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 10:16:06,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L99-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res#1.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_1|, thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][175], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 5#L71true, Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 500#(<= ~q2_back~0 ~q2_front~0), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:06,967 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:06,967 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:06,967 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:06,967 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:06,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([660] L87-->L93: Formula: (let ((.cse1 (* 4 v_~q2_front~0_68))) (let ((.cse0 (+ v_~q2~0.offset_47 .cse1))) (and (= (+ v_~q2_front~0_68 1) v_~q2_front~0_67) (= (select |v_#valid_154| v_~q2~0.base_51) 1) (<= 0 .cse0) (not (= (ite (and (< v_~q2_front~0_68 v_~n2~0_78) (< v_~q2_front~0_68 v_~q2_back~0_75) (<= 0 v_~q2_front~0_68)) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_~k~0#1_3| (select (select |v_#memory_int#1_44| v_~q2~0.base_51) .cse0)) (<= (+ v_~q2~0.offset_47 .cse1 4) (select |v_#length_121| v_~q2~0.base_51))))) InVars {~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, #valid=|v_#valid_154|, ~q2_front~0=v_~q2_front~0_68, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, #memory_int#1=|v_#memory_int#1_44|, ~q2_back~0=v_~q2_back~0_75} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~n2~0=v_~n2~0_78, ~q2~0.offset=v_~q2~0.offset_47, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~q2_front~0=v_~q2_front~0_67, #memory_int#1=|v_#memory_int#1_44|, thread3Thread1of1ForFork2_#t~post11#1=|v_thread3Thread1of1ForFork2_#t~post11#1_1|, #valid=|v_#valid_154|, ~q2~0.base=v_~q2~0.base_51, #length=|v_#length_121|, ~q2_back~0=v_~q2_back~0_75, thread3Thread1of1ForFork2_~k~0#1=|v_thread3Thread1of1ForFork2_~k~0#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork2_~k~0#1][124], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, 50#L93true, 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 5#L71true, Black: 484#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~q1_front~0 ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~q1_back~0 1))), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:06,968 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:06,968 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:06,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:06,968 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:07,221 INFO L124 PetriNetUnfolderBase]: 13247/22183 cut-off events. [2025-03-04 10:16:07,221 INFO L125 PetriNetUnfolderBase]: For 107365/108317 co-relation queries the response was YES. [2025-03-04 10:16:07,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83224 conditions, 22183 events. 13247/22183 cut-off events. For 107365/108317 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 166280 event pairs, 3396 based on Foata normal form. 220/22283 useless extension candidates. Maximal degree in co-relation 82281. Up to 12066 conditions per place. [2025-03-04 10:16:07,479 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 134 selfloop transitions, 42 changer transitions 0/185 dead transitions. [2025-03-04 10:16:07,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 185 transitions, 1798 flow [2025-03-04 10:16:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:16:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:16:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2025-03-04 10:16:07,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-04 10:16:07,480 INFO L175 Difference]: Start difference. First operand has 135 places, 143 transitions, 1195 flow. Second operand 6 states and 156 transitions. [2025-03-04 10:16:07,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 185 transitions, 1798 flow [2025-03-04 10:16:07,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 185 transitions, 1660 flow, removed 58 selfloop flow, removed 4 redundant places. [2025-03-04 10:16:07,784 INFO L231 Difference]: Finished difference. Result has 138 places, 145 transitions, 1214 flow [2025-03-04 10:16:07,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1065, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1214, PETRI_PLACES=138, PETRI_TRANSITIONS=145} [2025-03-04 10:16:07,784 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 79 predicate places. [2025-03-04 10:16:07,784 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 145 transitions, 1214 flow [2025-03-04 10:16:07,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:07,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:07,785 INFO L206 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] [2025-03-04 10:16:07,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:16:07,785 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:16:07,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1214646522, now seen corresponding path program 1 times [2025-03-04 10:16:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629450905] [2025-03-04 10:16:07,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:07,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:16:07,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:16:07,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:07,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629450905] [2025-03-04 10:16:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629450905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861705264] [2025-03-04 10:16:07,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:07,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:07,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:07,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:07,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:16:07,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:16:07,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:16:07,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:07,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:07,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:16:07,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:16:08,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:16:08,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861705264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:16:08,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:16:08,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-04 10:16:08,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314113196] [2025-03-04 10:16:08,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:16:08,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:16:08,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:08,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:16:08,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:16:08,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:16:08,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 145 transitions, 1214 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:08,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:08,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:16:08,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:09,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,201 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 10:16:09,201 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:09,201 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-03-04 10:16:09,201 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:09,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,206 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 10:16:09,206 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:09,206 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:09,206 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-03-04 10:16:09,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,263 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:09,263 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 10:16:09,263 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,263 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 32#L47true, 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:09,266 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:09,267 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,267 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 10:16:09,267 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,269 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:09,269 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 10:16:09,269 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,269 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 38#thread1EXITtrue, 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,271 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:09,271 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,271 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-03-04 10:16:09,271 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:09,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 32#L47true, 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,330 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:09,330 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:09,330 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:09,330 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:09,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 39#L120-1true, 257#true, 45#L54true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:09,334 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:09,334 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:09,334 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:09,334 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:09,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 38#thread1EXITtrue, 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,337 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:09,337 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:09,337 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:09,337 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:09,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 22#L121true, 45#L54true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,395 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-04 10:16:09,395 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:09,395 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:09,395 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:09,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][158], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 815#(and (<= ~q1_front~0 0) (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 41#L122true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:09,398 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-04 10:16:09,398 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:09,398 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:09,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:09,660 INFO L124 PetriNetUnfolderBase]: 10916/19226 cut-off events. [2025-03-04 10:16:09,660 INFO L125 PetriNetUnfolderBase]: For 128947/131041 co-relation queries the response was YES. [2025-03-04 10:16:09,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77300 conditions, 19226 events. 10916/19226 cut-off events. For 128947/131041 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 148761 event pairs, 3378 based on Foata normal form. 720/19471 useless extension candidates. Maximal degree in co-relation 76324. Up to 10281 conditions per place. [2025-03-04 10:16:09,788 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 136 selfloop transitions, 26 changer transitions 23/201 dead transitions. [2025-03-04 10:16:09,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 201 transitions, 1905 flow [2025-03-04 10:16:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:16:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:16:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 10:16:09,789 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-03-04 10:16:09,789 INFO L175 Difference]: Start difference. First operand has 138 places, 145 transitions, 1214 flow. Second operand 4 states and 136 transitions. [2025-03-04 10:16:09,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 201 transitions, 1905 flow [2025-03-04 10:16:10,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 201 transitions, 1887 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:16:10,003 INFO L231 Difference]: Finished difference. Result has 141 places, 133 transitions, 1245 flow [2025-03-04 10:16:10,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1245, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2025-03-04 10:16:10,004 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 82 predicate places. [2025-03-04 10:16:10,004 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 1245 flow [2025-03-04 10:16:10,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:10,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:10,004 INFO L206 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] [2025-03-04 10:16:10,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:10,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:10,209 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:16:10,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1323019094, now seen corresponding path program 1 times [2025-03-04 10:16:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433007832] [2025-03-04 10:16:10,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:10,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:16:10,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:16:10,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:10,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 10:16:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433007832] [2025-03-04 10:16:10,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433007832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:10,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555657169] [2025-03-04 10:16:10,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:10,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:10,453 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:10,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:16:10,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:16:10,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:16:10,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:10,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:16:10,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:16:10,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:16:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555657169] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:10,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:10,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-04 10:16:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294387525] [2025-03-04 10:16:10,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:10,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:16:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:10,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:16:10,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:16:10,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:16:10,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 1245 flow. Second operand has 15 states, 15 states have (on average 20.8) internal successors, (312), 15 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:10,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:10,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:16:10,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:11,696 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:11,697 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 10:16:11,697 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:11,697 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:11,697 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:11,708 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2025-03-04 10:16:11,708 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:11,708 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2025-03-04 10:16:11,708 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 3#L47-3true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:11,744 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:11,744 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:11,744 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,744 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:11,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), 32#L47true, Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:11,749 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:11,749 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,749 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:11,749 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:11,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 6#L60true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:11,755 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:11,755 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:11,755 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,755 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:11,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 38#thread1EXITtrue, 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:11,760 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-03-04 10:16:11,760 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2025-03-04 10:16:11,760 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,760 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:11,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 39#L120-1true, 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 45#L54true, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:11,792 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:11,793 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,793 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 10:16:11,793 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), 32#L47true, Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 48#thread3EXITtrue, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, Black: 226#(<= ~q2_back~0 ~q2_front~0), 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:11,800 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:11,800 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,800 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 10:16:11,800 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), Black: 226#(<= ~q2_back~0 ~q2_front~0), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 38#thread1EXITtrue, 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:11,807 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-03-04 10:16:11,807 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2025-03-04 10:16:11,807 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,807 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2025-03-04 10:16:11,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 22#L121true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 45#L54true, 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), Black: 226#(<= ~q2_back~0 ~q2_front~0), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0))]) [2025-03-04 10:16:11,834 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-04 10:16:11,834 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,834 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:11,834 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-03-04 10:16:11,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([648] L65-->L71: Formula: (let ((.cse1 (* 4 v_~q1_front~0_86))) (let ((.cse0 (+ v_~q1~0.offset_71 .cse1))) (and (not (= (ite (and (< v_~q1_front~0_86 v_~q1_back~0_106) (<= 0 v_~q1_front~0_86) (< v_~q1_front~0_86 v_~n1~0_83)) 1 0) 0)) (= v_~q1_front~0_85 (+ v_~q1_front~0_86 1)) (= |v_thread2Thread1of1ForFork0_~j~0#1_3| (select (select |v_#memory_int#1_46| v_~q1~0.base_76) .cse0)) (<= (+ v_~q1~0.offset_71 .cse1 4) (select |v_#length_125| v_~q1~0.base_76)) (= (select |v_#valid_158| v_~q1~0.base_76) 1) (<= 0 .cse0)))) InVars {~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_86, ~q1_back~0=v_~q1_back~0_106, ~n1~0=v_~n1~0_83, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|, #memory_int#1=|v_#memory_int#1_46|} OutVars{thread2Thread1of1ForFork0_~j~0#1=|v_thread2Thread1of1ForFork0_~j~0#1_3|, ~q1~0.offset=v_~q1~0.offset_71, ~q1_front~0=v_~q1_front~0_85, ~n1~0=v_~n1~0_83, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, #memory_int#1=|v_#memory_int#1_46|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q1_back~0=v_~q1_back~0_106, ~q1~0.base=v_~q1~0.base_76, #valid=|v_#valid_158|, #length=|v_#length_125|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_~j~0#1, ~q1_front~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~post7#1][169], [Black: 801#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0)))), Black: 252#(and (or (< ~t~0 (+ ~N~0 1)) (< ~t~0 (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0 1))) (or (< (+ |thread3Thread1of1ForFork2_~k~0#1| ~N~0) (+ ~t~0 1)) (< ~N~0 (+ ~t~0 1)))), Black: 672#(or (< ~n2~0 1) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), Black: 598#(and (<= ~n2~0 1) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 799#(and (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1)))), Black: 797#(and (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (select |#valid| ~q2~0.base) 1)) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))), Black: 605#(= |thread2Thread1of1ForFork0_~j~0#1| 1), 839#true, Black: 908#(<= ~q1_back~0 (+ ~q1_front~0 1)), Black: 844#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 856#(<= ~q1_back~0 ~q1_front~0), 257#true, 48#thread3EXITtrue, 245#(and (<= (* ~n2~0 4) (select |#length| ~q2~0.base)) (= ~q2~0.offset 0)), 976#(<= ~q2_front~0 ~q2_back~0), 504#true, 235#(= (select |#valid| ~q2~0.base) 1), Black: 226#(<= ~q2_back~0 ~q2_front~0), 205#(and (<= 0 ~q1~0.offset) (<= (+ (* ~n1~0 4) ~q1~0.offset) (select |#length| ~q1~0.base))), 847#true, Black: 230#(<= ~q1_back~0 ~q1_front~0), 41#L122true, 246#true, Black: 488#(and (<= ~n1~0 1) (<= (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 1))), 5#L71true, Black: 490#(and (<= 1 ~q1_back~0) (= ~n1~0 1) (<= (+ ~q1_front~0 1) ~q1_back~0)), 500#(<= ~q2_back~0 ~q2_front~0), Black: 789#(and (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0)) (= ~q1_back~0 0)))) (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| ~q2~0.base) 0)))), Black: 501#(<= ~q2_back~0 (+ 1 ~q2_front~0)), Black: 686#(or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 795#(and (<= 0 ~q1_front~0) (<= ~n2~0 1) (<= (+ ~q1_front~0 1) ~n1~0) (= ~q1~0.offset 0) (= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (<= (+ ~q1_front~0 1) ~q1_back~0) (or (not (= (select |#valid| ~q2~0.base) 0)) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n1~0 2)), 221#(= (select |#valid| ~q1~0.base) 1), Black: 767#(and (= ~q1~0.offset 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2)) (= ~q1_back~0 ~q1_front~0) (or (not (= ~q1_back~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (<= ~n1~0 2) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 717#(or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))), Black: 514#(not (= |thread2Thread1of1ForFork0_~j~0#1| 0)), Black: 811#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0))), 129#(<= ~n2~0 2147483647), Black: 807#(and (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (and (or (< ~q1_front~0 1) (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 3))) (or (not (= ~q1_front~0 0)) (and (not (= (select |#valid| ~q2~0.base) 0)) (= ~q1_back~0 0))))) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 2) |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~q1_back~0 ~q1_front~0) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0) (and (= ~q1~0.offset 0) (or (< ~q1_back~0 1) (< ~n1~0 3)))) (or (= ~q1_back~0 ~q1_front~0) (< ~n2~0 1) (= ~n1~0 (+ ~q1_back~0 1)) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (not (= (+ (* ~q1_back~0 4) ~q1~0.offset) 0)) (not (= ~q1_front~0 0)) (not (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 809#(and (<= ~q1_front~0 0) (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))), Black: 813#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (<= ~n2~0 1) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (= |thread2Thread1of1ForFork0_~j~0#1| 1)), Black: 250#(and (<= 0 ~N~0) (= ~t~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 817#(and (or (not (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0)) (< ~n2~0 1) (< ~q1_back~0 0) (< ~n1~0 (+ ~q1_back~0 1))) (or (and (or (< (+ ~q1_front~0 ~n1~0) (+ ~q1_back~0 2)) (< ~q1_front~0 1)) (or (and (= (select (select |#memory_int#1| ~q1~0.base) ~q1~0.offset) 1) (not (= (select |#valid| ~q2~0.base) 0))) (not (= ~q1_front~0 0)))) (and (= ~q1~0.offset 0) (<= ~n1~0 ~q1_back~0))) (not (= |thread2Thread1of1ForFork0_~j~0#1| 0)))]) [2025-03-04 10:16:11,850 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2025-03-04 10:16:11,850 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-03-04 10:16:11,850 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2025-03-04 10:16:11,850 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-03-04 10:16:11,991 INFO L124 PetriNetUnfolderBase]: 7098/13356 cut-off events. [2025-03-04 10:16:11,991 INFO L125 PetriNetUnfolderBase]: For 118302/118997 co-relation queries the response was YES. [2025-03-04 10:16:12,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58101 conditions, 13356 events. 7098/13356 cut-off events. For 118302/118997 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 104531 event pairs, 3977 based on Foata normal form. 414/13547 useless extension candidates. Maximal degree in co-relation 53305. Up to 6581 conditions per place. [2025-03-04 10:16:12,078 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 59 selfloop transitions, 29 changer transitions 113/213 dead transitions. [2025-03-04 10:16:12,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 213 transitions, 2549 flow [2025-03-04 10:16:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:16:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:16:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2025-03-04 10:16:12,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2025-03-04 10:16:12,079 INFO L175 Difference]: Start difference. First operand has 141 places, 133 transitions, 1245 flow. Second operand 9 states and 219 transitions. [2025-03-04 10:16:12,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 213 transitions, 2549 flow [2025-03-04 10:16:12,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 213 transitions, 2276 flow, removed 127 selfloop flow, removed 7 redundant places. [2025-03-04 10:16:12,334 INFO L231 Difference]: Finished difference. Result has 138 places, 100 transitions, 943 flow [2025-03-04 10:16:12,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=943, PETRI_PLACES=138, PETRI_TRANSITIONS=100} [2025-03-04 10:16:12,334 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 79 predicate places. [2025-03-04 10:16:12,334 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 100 transitions, 943 flow [2025-03-04 10:16:12,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 20.8) internal successors, (312), 15 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:12,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:12,334 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-03-04 10:16:12,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:12,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:12,536 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:16:12,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:12,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1320217270, now seen corresponding path program 2 times [2025-03-04 10:16:12,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:12,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810550911] [2025-03-04 10:16:12,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:12,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:12,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:16:12,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:16:12,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:12,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:12,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810550911] [2025-03-04 10:16:12,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810550911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746156061] [2025-03-04 10:16:12,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:12,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:12,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:12,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:12,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:16:13,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-03-04 10:16:13,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:16:13,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:13,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:13,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 10:16:13,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:13,402 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2025-03-04 10:16:13,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 38 [2025-03-04 10:16:13,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:16:13,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:13,900 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-03-04 10:16:13,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-03-04 10:16:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:16:14,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746156061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:14,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 31 [2025-03-04 10:16:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036311995] [2025-03-04 10:16:14,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:14,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:16:14,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:14,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:16:14,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:16:14,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:16:14,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 100 transitions, 943 flow. Second operand has 32 states, 32 states have (on average 15.21875) internal successors, (487), 32 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:14,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:14,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:16:14,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:19,006 INFO L124 PetriNetUnfolderBase]: 26484/40850 cut-off events. [2025-03-04 10:16:19,006 INFO L125 PetriNetUnfolderBase]: For 207886/207886 co-relation queries the response was YES. [2025-03-04 10:16:19,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158625 conditions, 40850 events. 26484/40850 cut-off events. For 207886/207886 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 296084 event pairs, 2322 based on Foata normal form. 877/39415 useless extension candidates. Maximal degree in co-relation 148089. Up to 6931 conditions per place. [2025-03-04 10:16:19,340 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 367 selfloop transitions, 92 changer transitions 37/502 dead transitions. [2025-03-04 10:16:19,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 502 transitions, 5313 flow [2025-03-04 10:16:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 10:16:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 10:16:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 649 transitions. [2025-03-04 10:16:19,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4006172839506173 [2025-03-04 10:16:19,342 INFO L175 Difference]: Start difference. First operand has 138 places, 100 transitions, 943 flow. Second operand 27 states and 649 transitions. [2025-03-04 10:16:19,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 502 transitions, 5313 flow [2025-03-04 10:16:19,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 502 transitions, 4395 flow, removed 422 selfloop flow, removed 12 redundant places. [2025-03-04 10:16:19,943 INFO L231 Difference]: Finished difference. Result has 155 places, 169 transitions, 1855 flow [2025-03-04 10:16:19,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1855, PETRI_PLACES=155, PETRI_TRANSITIONS=169} [2025-03-04 10:16:19,944 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 96 predicate places. [2025-03-04 10:16:19,944 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 169 transitions, 1855 flow [2025-03-04 10:16:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 15.21875) internal successors, (487), 32 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:19,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:19,944 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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] [2025-03-04 10:16:19,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:16:20,148 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:16:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1754405102, now seen corresponding path program 3 times [2025-03-04 10:16:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634378728] [2025-03-04 10:16:20,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:20,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-04 10:16:20,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 44 statements. [2025-03-04 10:16:20,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:16:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:16:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634378728] [2025-03-04 10:16:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634378728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304335495] [2025-03-04 10:16:20,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:16:20,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:20,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:20,253 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:20,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:16:20,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-04 10:16:20,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 39 of 44 statements. [2025-03-04 10:16:20,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:16:20,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:20,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:16:20,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:16:20,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:20,568 INFO L349 Elim1Store]: treesize reduction 23, result has 75.3 percent of original size [2025-03-04 10:16:20,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 82 [2025-03-04 10:16:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 10:16:20,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304335495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:20,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:20,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2025-03-04 10:16:20,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304693764] [2025-03-04 10:16:20,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:20,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:16:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:20,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:16:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:16:20,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 60 [2025-03-04 10:16:20,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 169 transitions, 1855 flow. Second operand has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:20,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:20,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 60 [2025-03-04 10:16:20,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:25,173 INFO L124 PetriNetUnfolderBase]: 27145/42357 cut-off events. [2025-03-04 10:16:25,173 INFO L125 PetriNetUnfolderBase]: For 272775/272775 co-relation queries the response was YES. [2025-03-04 10:16:25,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184186 conditions, 42357 events. 27145/42357 cut-off events. For 272775/272775 co-relation queries the response was YES. Maximal size of possible extension queue 1465. Compared 310790 event pairs, 2429 based on Foata normal form. 1603/43954 useless extension candidates. Maximal degree in co-relation 181306. Up to 11227 conditions per place. [2025-03-04 10:16:25,525 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 323 selfloop transitions, 70 changer transitions 0/399 dead transitions. [2025-03-04 10:16:25,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 399 transitions, 5049 flow [2025-03-04 10:16:25,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:16:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:16:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 300 transitions. [2025-03-04 10:16:25,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-03-04 10:16:25,527 INFO L175 Difference]: Start difference. First operand has 155 places, 169 transitions, 1855 flow. Second operand 12 states and 300 transitions. [2025-03-04 10:16:25,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 399 transitions, 5049 flow [2025-03-04 10:16:26,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 399 transitions, 4832 flow, removed 98 selfloop flow, removed 6 redundant places. [2025-03-04 10:16:26,253 INFO L231 Difference]: Finished difference. Result has 162 places, 193 transitions, 2208 flow [2025-03-04 10:16:26,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2208, PETRI_PLACES=162, PETRI_TRANSITIONS=193} [2025-03-04 10:16:26,254 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 103 predicate places. [2025-03-04 10:16:26,254 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 193 transitions, 2208 flow [2025-03-04 10:16:26,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.692307692307693) internal successors, (230), 13 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:26,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:26,254 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2025-03-04 10:16:26,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:16:26,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:26,455 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:16:26,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash -757099688, now seen corresponding path program 1 times [2025-03-04 10:16:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:26,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239099788] [2025-03-04 10:16:26,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:26,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:16:26,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:16:26,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:26,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:27,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:27,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239099788] [2025-03-04 10:16:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239099788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:27,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547847870] [2025-03-04 10:16:27,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:16:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:27,590 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:27,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:16:27,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:16:27,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:16:27,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:27,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:27,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-04 10:16:27,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:28,496 INFO L349 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2025-03-04 10:16:28,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 13 [2025-03-04 10:16:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:28,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:29,277 INFO L349 Elim1Store]: treesize reduction 19, result has 79.6 percent of original size [2025-03-04 10:16:29,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 87 [2025-03-04 10:16:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:16:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547847870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:30,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 60 [2025-03-04 10:16:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473027104] [2025-03-04 10:16:30,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:30,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-04 10:16:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-04 10:16:30,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=3298, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 10:16:30,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 60 [2025-03-04 10:16:30,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 193 transitions, 2208 flow. Second operand has 61 states, 61 states have (on average 13.081967213114755) internal successors, (798), 61 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:16:30,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:30,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 60 [2025-03-04 10:16:30,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:01,925 INFO L124 PetriNetUnfolderBase]: 71869/109600 cut-off events. [2025-03-04 10:17:01,925 INFO L125 PetriNetUnfolderBase]: For 779026/781894 co-relation queries the response was YES. [2025-03-04 10:17:02,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507900 conditions, 109600 events. 71869/109600 cut-off events. For 779026/781894 co-relation queries the response was YES. Maximal size of possible extension queue 3622. Compared 877291 event pairs, 3715 based on Foata normal form. 1355/110683 useless extension candidates. Maximal degree in co-relation 438844. Up to 31983 conditions per place. [2025-03-04 10:17:03,170 INFO L140 encePairwiseOnDemand]: 40/60 looper letters, 1111 selfloop transitions, 846 changer transitions 285/2247 dead transitions. [2025-03-04 10:17:03,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 2247 transitions, 24682 flow [2025-03-04 10:17:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2025-03-04 10:17:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2025-03-04 10:17:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 3507 transitions. [2025-03-04 10:17:03,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.334 [2025-03-04 10:17:03,175 INFO L175 Difference]: Start difference. First operand has 162 places, 193 transitions, 2208 flow. Second operand 175 states and 3507 transitions. [2025-03-04 10:17:03,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 2247 transitions, 24682 flow [2025-03-04 10:17:07,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 2247 transitions, 24128 flow, removed 167 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:07,634 INFO L231 Difference]: Finished difference. Result has 389 places, 1118 transitions, 16206 flow [2025-03-04 10:17:07,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2136, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=175, PETRI_FLOW=16206, PETRI_PLACES=389, PETRI_TRANSITIONS=1118} [2025-03-04 10:17:07,635 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 330 predicate places. [2025-03-04 10:17:07,635 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 1118 transitions, 16206 flow [2025-03-04 10:17:07,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 13.081967213114755) internal successors, (798), 61 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:07,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:07,635 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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] [2025-03-04 10:17:07,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:17:07,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:17:07,836 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2025-03-04 10:17:07,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1843112050, now seen corresponding path program 2 times [2025-03-04 10:17:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274049484] [2025-03-04 10:17:07,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:17:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:07,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-04 10:17:07,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:17:07,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:17:07,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat